Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2.5M 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 CANConstruction-PT-040-ReachabilityCardinality-2025-00
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-01
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-02
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-03
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-04
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-05
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-06
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-07
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-08
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-09
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-10
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-11
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-12
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-13
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-14
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748659498287

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 02:45:00] [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-31 02:45:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:45:00] [INFO ] Load time of PNML (sax parser for PT used): 549 ms
[2025-05-31 02:45:00] [INFO ] Transformed 3682 places.
[2025-05-31 02:45:01] [INFO ] Transformed 6720 transitions.
[2025-05-31 02:45:01] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 771 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (56 resets) in 4202 ms. (9 steps per ms) remains 8/16 properties
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1185 ms. (33 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 694 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 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
[2025-05-31 02:45:03] [INFO ] Flatten gal took : 1212 ms
// Phase 1: matrix 6720 rows 3682 cols
[2025-05-31 02:45:03] [INFO ] Computed 81 invariants in 202 ms
[2025-05-31 02:45:03] [INFO ] Flatten gal took : 307 ms
[2025-05-31 02:45:04] [INFO ] State equation strengthened by 3160 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 02:45:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15108588803381807044.gal : 245 ms
[2025-05-31 02:45:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12352004247406988297.prop : 6 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/ReachabilityCardinality15108588803381807044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12352004247406988297.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
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/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality12352004247406988297.prop.
Problem CANConstruction-PT-040-ReachabilityCardinality-2025-04 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2025-06 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2025-09 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2025-13 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3504/3641 variables, 39/39 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3641 variables, 2/41 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3641 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/3643 variables, 2/43 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3643 variables, 0/43 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 38/3681 variables, 38/81 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3681 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SMT process timed out in 5673ms, After SMT, problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 114 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 3682 transition count 6499
Reduce places removed 221 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 227 rules applied. Total rules applied 448 place count 3461 transition count 6493
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 454 place count 3455 transition count 6493
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 454 place count 3455 transition count 6490
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 460 place count 3452 transition count 6490
Discarding 1466 places :
Symmetric choice reduction at 3 with 1466 rule applications. Total rules 1926 place count 1986 transition count 3558
Iterating global reduction 3 with 1466 rules applied. Total rules applied 3392 place count 1986 transition count 3558
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 3462 place count 1951 transition count 3523
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 3484 place count 1951 transition count 3501
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 3506 place count 1929 transition count 3501
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 4 with 40 rules applied. Total rules applied 3546 place count 1929 transition count 3461
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 3586 place count 1889 transition count 3461
Partial Free-agglomeration rule applied 58 times.
Drop transitions (Partial Free agglomeration) removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 3644 place count 1889 transition count 3461
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 3646 place count 1889 transition count 3461
Applied a total of 3646 rules in 2849 ms. Remains 1889 /3682 variables (removed 1793) and now considering 3461/6720 (removed 3259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2865 ms. Remains : 1889/3682 places, 3461/6720 transitions.
RANDOM walk for 40000 steps (134 resets) in 1216 ms. (32 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
// Phase 1: matrix 3461 rows 1889 cols
[2025-05-31 02:45:12] [INFO ] Computed 81 invariants in 34 ms
[2025-05-31 02:45:12] [INFO ] State equation strengthened by 3219 read => feed constraints.
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/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1747/1845 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1845 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1845 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/1850 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1850 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 38/1888 variables, 38/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1888 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3461/5349 variables, 1888/1969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5349 variables, 3219/5188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5349 variables, 0/5188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/5350 variables, 1/5189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5350 variables, 0/5189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/5350 variables, 0/5189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5350/5350 variables, and 5189 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6498 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1889/1889 constraints, ReadFeed: 3219/3219 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1747/1845 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1845 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:22] [INFO ] Deduced a trap composed of 2 places in 2290 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 42
[2025-05-31 02:45:25] [INFO ] Deduced a trap composed of 43 places in 3594 ms of which 1191 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :42 after 43
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :43 after 45
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :45 after 48
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :48 after 54
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :54 after 65
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :65 after 82
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :82 after 92
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :92 after 101
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :101 after 119
[2025-05-31 02:45:32] [INFO ] Deduced a trap composed of 43 places in 6276 ms of which 4360 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 43 places in 2096 ms of which 716 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1721 after 1760
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 43 places in 5334 ms of which 3741 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:41] [INFO ] Deduced a trap composed of 43 places in 1760 ms of which 448 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:45] [INFO ] Deduced a trap composed of 43 places in 4099 ms of which 2644 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:48] [INFO ] Deduced a trap composed of 43 places in 2486 ms of which 931 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1760 after 1913
[2025-05-31 02:45:49] [INFO ] Deduced a trap composed of 43 places in 1431 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:51] [INFO ] Deduced a trap composed of 43 places in 1535 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:53] [INFO ] Deduced a trap composed of 43 places in 2125 ms of which 592 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:55] [INFO ] Deduced a trap composed of 43 places in 1461 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:56] [INFO ] Deduced a trap composed of 43 places in 1296 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:58] [INFO ] Deduced a trap composed of 43 places in 2014 ms of which 725 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:00] [INFO ] Deduced a trap composed of 43 places in 1588 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1913 after 2195
[2025-05-31 02:46:01] [INFO ] Deduced a trap composed of 43 places in 1613 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:03] [INFO ] Deduced a trap composed of 43 places in 1928 ms of which 313 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:05] [INFO ] Deduced a trap composed of 43 places in 1986 ms of which 466 ms to minimize.
SMT process timed out in 53020ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 98 out of 1889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1889/1889 places, 3461/3461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1889 transition count 3459
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 1887 transition count 3457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 1885 transition count 3457
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 1882 transition count 3454
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 1882 transition count 3454
Applied a total of 15 rules in 1577 ms. Remains 1882 /1889 variables (removed 7) and now considering 3454/3461 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1577 ms. Remains : 1882/1889 places, 3454/3461 transitions.
RANDOM walk for 40000 steps (133 resets) in 1028 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :2195 after 5312
Interrupted probabilistic random walk after 103305 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :1 out of 3
Probabilistic random walk after 103305 steps, saw 40953 distinct states, run finished after 3010 ms. (steps per millisecond=34 ) properties seen :1
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 3454 rows 1882 cols
[2025-05-31 02:46:11] [INFO ] Computed 81 invariants in 22 ms
[2025-05-31 02:46:11] [INFO ] State equation strengthened by 3223 read => feed constraints.
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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1787/1826 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1826 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1826 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/1842 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/1881 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1881 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3454/5335 variables, 1881/1962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5335 variables, 3223/5185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5335 variables, 0/5185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/5336 variables, 1/5186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5336 variables, 0/5186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/5336 variables, 0/5186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5336/5336 variables, and 5186 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3914 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1882/1882 constraints, ReadFeed: 3223/3223 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1787/1826 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1826 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:17] [INFO ] Deduced a trap composed of 2 places in 2005 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:18] [INFO ] Deduced a trap composed of 43 places in 1092 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:19] [INFO ] Deduced a trap composed of 43 places in 853 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:20] [INFO ] Deduced a trap composed of 43 places in 944 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:21] [INFO ] Deduced a trap composed of 43 places in 943 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:22] [INFO ] Deduced a trap composed of 43 places in 802 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:23] [INFO ] Deduced a trap composed of 43 places in 772 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:24] [INFO ] Deduced a trap composed of 43 places in 927 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:25] [INFO ] Deduced a trap composed of 43 places in 710 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:25] [INFO ] Deduced a trap composed of 43 places in 802 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:27] [INFO ] Deduced a trap composed of 43 places in 976 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:27] [INFO ] Deduced a trap composed of 43 places in 757 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:28] [INFO ] Deduced a trap composed of 43 places in 777 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:29] [INFO ] Deduced a trap composed of 43 places in 859 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:30] [INFO ] Deduced a trap composed of 43 places in 665 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:31] [INFO ] Deduced a trap composed of 43 places in 727 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:31] [INFO ] Deduced a trap composed of 43 places in 758 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:32] [INFO ] Deduced a trap composed of 44 places in 730 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:33] [INFO ] Deduced a trap composed of 44 places in 803 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:34] [INFO ] Deduced a trap composed of 44 places in 590 ms of which 57 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1826 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:34] [INFO ] Deduced a trap composed of 43 places in 606 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:35] [INFO ] Deduced a trap composed of 44 places in 639 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:36] [INFO ] Deduced a trap composed of 44 places in 678 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:37] [INFO ] Deduced a trap composed of 43 places in 681 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:37] [INFO ] Deduced a trap composed of 47 places in 505 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:38] [INFO ] Deduced a trap composed of 48 places in 482 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:38] [INFO ] Deduced a trap composed of 43 places in 637 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:39] [INFO ] Deduced a trap composed of 43 places in 810 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:40] [INFO ] Deduced a trap composed of 44 places in 463 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:40] [INFO ] Deduced a trap composed of 44 places in 467 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:41] [INFO ] Deduced a trap composed of 44 places in 549 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:42] [INFO ] Deduced a trap composed of 47 places in 768 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:42] [INFO ] Deduced a trap composed of 48 places in 484 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:43] [INFO ] Deduced a trap composed of 48 places in 432 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:43] [INFO ] Deduced a trap composed of 44 places in 419 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:44] [INFO ] Deduced a trap composed of 48 places in 448 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:45] [INFO ] Deduced a trap composed of 43 places in 657 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:45] [INFO ] Deduced a trap composed of 43 places in 577 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:46] [INFO ] Deduced a trap composed of 43 places in 671 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:47] [INFO ] Deduced a trap composed of 43 places in 597 ms of which 45 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1826 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1826 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/1842 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:01] [INFO ] Deduced a trap composed of 43 places in 14221 ms of which 12005 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :5312 after 7379
[2025-05-31 02:47:16] [INFO ] Deduced a trap composed of 43 places in 14195 ms of which 12012 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:30] [INFO ] Deduced a trap composed of 43 places in 14157 ms of which 12004 ms to minimize.
SMT process timed out in 79352ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 39 out of 1882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1882/1882 places, 3454/3454 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1882 transition count 3453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1881 transition count 3453
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1881 transition count 3452
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1880 transition count 3452
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 16 place count 1868 transition count 3428
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 1868 transition count 3428
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 58 place count 1853 transition count 3413
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 1845 transition count 3417
Applied a total of 74 rules in 1130 ms. Remains 1845 /1882 variables (removed 37) and now considering 3417/3454 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1136 ms. Remains : 1845/1882 places, 3417/3454 transitions.
RANDOM walk for 40000 steps (137 resets) in 912 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 126282 steps, run timeout after 3002 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 126282 steps, saw 53989 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 3417 rows 1845 cols
[2025-05-31 02:47:34] [INFO ] Computed 81 invariants in 21 ms
[2025-05-31 02:47:34] [INFO ] State equation strengthened by 3259 read => feed constraints.
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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1750/1789 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1789 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1789 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/1805 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1805 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/1844 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3417/5261 variables, 1844/1925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5261 variables, 3259/5184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5261 variables, 0/5184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/5262 variables, 1/5185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5262 variables, 0/5185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/5262 variables, 0/5185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5262/5262 variables, and 5185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3513 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1845/1845 constraints, ReadFeed: 3259/3259 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1750/1789 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1789 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:40] [INFO ] Deduced a trap composed of 2 places in 1690 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:41] [INFO ] Deduced a trap composed of 43 places in 1033 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:42] [INFO ] Deduced a trap composed of 43 places in 1188 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:43] [INFO ] Deduced a trap composed of 43 places in 1016 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:44] [INFO ] Deduced a trap composed of 43 places in 973 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:45] [INFO ] Deduced a trap composed of 43 places in 936 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:46] [INFO ] Deduced a trap composed of 43 places in 827 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:47] [INFO ] Deduced a trap composed of 43 places in 826 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 43 places in 805 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:49] [INFO ] Deduced a trap composed of 45 places in 803 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:50] [INFO ] Deduced a trap composed of 43 places in 928 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:51] [INFO ] Deduced a trap composed of 43 places in 1117 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:52] [INFO ] Deduced a trap composed of 43 places in 1154 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:53] [INFO ] Deduced a trap composed of 43 places in 1022 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:54] [INFO ] Deduced a trap composed of 43 places in 1280 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:56] [INFO ] Deduced a trap composed of 43 places in 1020 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:57] [INFO ] Deduced a trap composed of 43 places in 1049 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 131072
[2025-05-31 02:47:58] [INFO ] Deduced a trap composed of 43 places in 864 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :7379 after 11123
[2025-05-31 02:47:59] [INFO ] Deduced a trap composed of 43 places in 852 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:59] [INFO ] Deduced a trap composed of 43 places in 743 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1789 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:00] [INFO ] Deduced a trap composed of 43 places in 773 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:01] [INFO ] Deduced a trap composed of 43 places in 906 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:02] [INFO ] Deduced a trap composed of 43 places in 720 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:03] [INFO ] Deduced a trap composed of 43 places in 840 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:03] [INFO ] Deduced a trap composed of 43 places in 733 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:04] [INFO ] Deduced a trap composed of 43 places in 700 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:05] [INFO ] Deduced a trap composed of 43 places in 542 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:06] [INFO ] Deduced a trap composed of 43 places in 717 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:06] [INFO ] Deduced a trap composed of 43 places in 689 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:07] [INFO ] Deduced a trap composed of 43 places in 592 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:08] [INFO ] Deduced a trap composed of 43 places in 549 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:08] [INFO ] Deduced a trap composed of 43 places in 627 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:09] [INFO ] Deduced a trap composed of 43 places in 625 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:10] [INFO ] Deduced a trap composed of 43 places in 633 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:10] [INFO ] Deduced a trap composed of 43 places in 574 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:11] [INFO ] Deduced a trap composed of 43 places in 702 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:12] [INFO ] Deduced a trap composed of 43 places in 589 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:12] [INFO ] Deduced a trap composed of 43 places in 589 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:13] [INFO ] Deduced a trap composed of 43 places in 612 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:13] [INFO ] Deduced a trap composed of 43 places in 460 ms of which 55 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1789 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:14] [INFO ] Deduced a trap composed of 43 places in 703 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:15] [INFO ] Deduced a trap composed of 45 places in 635 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:16] [INFO ] Deduced a trap composed of 43 places in 537 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:16] [INFO ] Deduced a trap composed of 43 places in 599 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:17] [INFO ] Deduced a trap composed of 43 places in 588 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:18] [INFO ] Deduced a trap composed of 43 places in 664 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:18] [INFO ] Deduced a trap composed of 43 places in 501 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:19] [INFO ] Deduced a trap composed of 45 places in 370 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:19] [INFO ] Deduced a trap composed of 45 places in 574 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:20] [INFO ] Deduced a trap composed of 45 places in 494 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:20] [INFO ] Deduced a trap composed of 45 places in 354 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:21] [INFO ] Deduced a trap composed of 45 places in 492 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:21] [INFO ] Deduced a trap composed of 45 places in 535 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:22] [INFO ] Deduced a trap composed of 45 places in 467 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:22] [INFO ] Deduced a trap composed of 45 places in 434 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:23] [INFO ] Deduced a trap composed of 45 places in 683 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:23] [INFO ] Deduced a trap composed of 45 places in 454 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:24] [INFO ] Deduced a trap composed of 45 places in 490 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:25] [INFO ] Deduced a trap composed of 45 places in 549 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:25] [INFO ] Deduced a trap composed of 45 places in 405 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1789 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:26] [INFO ] Deduced a trap composed of 45 places in 447 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:26] [INFO ] Deduced a trap composed of 45 places in 433 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:26] [INFO ] Deduced a trap composed of 45 places in 368 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:27] [INFO ] Deduced a trap composed of 45 places in 396 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:27] [INFO ] Deduced a trap composed of 45 places in 434 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:28] [INFO ] Deduced a trap composed of 45 places in 398 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:28] [INFO ] Deduced a trap composed of 45 places in 375 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:29] [INFO ] Deduced a trap composed of 45 places in 563 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:29] [INFO ] Deduced a trap composed of 45 places in 532 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:30] [INFO ] Deduced a trap composed of 45 places in 439 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:30] [INFO ] Deduced a trap composed of 45 places in 477 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:31] [INFO ] Deduced a trap composed of 45 places in 406 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:31] [INFO ] Deduced a trap composed of 45 places in 513 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:32] [INFO ] Deduced a trap composed of 45 places in 518 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:32] [INFO ] Deduced a trap composed of 45 places in 406 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:33] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:33] [INFO ] Deduced a trap composed of 45 places in 376 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:34] [INFO ] Deduced a trap composed of 43 places in 560 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:34] [INFO ] Deduced a trap composed of 43 places in 553 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:35] [INFO ] Deduced a trap composed of 43 places in 564 ms of which 53 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1789 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:36] [INFO ] Deduced a trap composed of 43 places in 546 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:36] [INFO ] Deduced a trap composed of 43 places in 510 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:37] [INFO ] Deduced a trap composed of 43 places in 515 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:37] [INFO ] Deduced a trap composed of 45 places in 603 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:38] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:38] [INFO ] Deduced a trap composed of 45 places in 593 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:39] [INFO ] Deduced a trap composed of 45 places in 485 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:40] [INFO ] Deduced a trap composed of 45 places in 482 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:40] [INFO ] Deduced a trap composed of 45 places in 372 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:40] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:41] [INFO ] Deduced a trap composed of 45 places in 349 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:41] [INFO ] Deduced a trap composed of 45 places in 373 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:42] [INFO ] Deduced a trap composed of 45 places in 358 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:42] [INFO ] Deduced a trap composed of 45 places in 336 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:42] [INFO ] Deduced a trap composed of 45 places in 341 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:43] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:43] [INFO ] Deduced a trap composed of 45 places in 293 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:44] [INFO ] Deduced a trap composed of 45 places in 452 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:44] [INFO ] Deduced a trap composed of 45 places in 329 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:44] [INFO ] Deduced a trap composed of 45 places in 295 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1789 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:45] [INFO ] Deduced a trap composed of 45 places in 367 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:45] [INFO ] Deduced a trap composed of 45 places in 327 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:46] [INFO ] Deduced a trap composed of 45 places in 336 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:46] [INFO ] Deduced a trap composed of 45 places in 291 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:46] [INFO ] Deduced a trap composed of 45 places in 292 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:47] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:47] [INFO ] Deduced a trap composed of 45 places in 449 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1789 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1789 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/1805 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:54] [INFO ] Deduced a trap composed of 43 places in 6656 ms of which 5101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:57] [INFO ] Deduced a trap composed of 43 places in 2609 ms of which 1145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:00] [INFO ] Deduced a trap composed of 43 places in 3414 ms of which 2032 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:04] [INFO ] Deduced a trap composed of 43 places in 3231 ms of which 1796 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:07] [INFO ] Deduced a trap composed of 43 places in 3310 ms of which 1833 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:10] [INFO ] Deduced a trap composed of 43 places in 3247 ms of which 1614 ms to minimize.
SMT process timed out in 96055ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 39 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 3417/3417 transitions.
Applied a total of 0 rules in 193 ms. Remains 1845 /1845 variables (removed 0) and now considering 3417/3417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 1845/1845 places, 3417/3417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 3417/3417 transitions.
Applied a total of 0 rules in 175 ms. Remains 1845 /1845 variables (removed 0) and now considering 3417/3417 (removed 0) transitions.
[2025-05-31 02:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:49:14] [INFO ] Implicit Places using invariants in 3287 ms returned [5, 11, 15, 19, 25, 31, 38, 44, 50, 56, 60, 64, 70, 74, 79, 83, 89, 96, 102, 114, 120, 126, 130, 136, 142, 148, 154, 160, 166, 172, 176, 182, 188, 196, 202, 208, 212, 219, 225]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 3303 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1806/1845 places, 3417/3417 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1806 transition count 3406
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1795 transition count 3406
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 1793 transition count 3404
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 1793 transition count 3404
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 108 place count 1752 transition count 3363
Applied a total of 108 rules in 947 ms. Remains 1752 /1806 variables (removed 54) and now considering 3363/3417 (removed 54) transitions.
// Phase 1: matrix 3363 rows 1752 cols
[2025-05-31 02:49:15] [INFO ] Computed 42 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:49:18] [INFO ] Implicit Places using invariants in 2693 ms returned []
[2025-05-31 02:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:49:20] [INFO ] State equation strengthened by 3197 read => feed constraints.
[2025-05-31 02:49:50] [INFO ] Performed 713/1752 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 02:50:20] [INFO ] Performed 1425/1752 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-05-31 02:50:34] [INFO ] Implicit Places using invariants and state equation in 75776 ms returned []
Implicit Place search using SMT with State Equation took 78481 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1752/1845 places, 3363/3417 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82915 ms. Remains : 1752/1845 places, 3363/3417 transitions.
RANDOM walk for 40000 steps (140 resets) in 830 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 137806 steps, run timeout after 3003 ms. (steps per millisecond=45 ) properties seen :0 out of 2
Probabilistic random walk after 137806 steps, saw 73945 distinct states, run finished after 3007 ms. (steps per millisecond=45 ) properties seen :0
[2025-05-31 02:50:37] [INFO ] Invariant cache hit.
[2025-05-31 02:50:37] [INFO ] State equation strengthened by 3197 read => feed constraints.
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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1696/1735 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1735 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1735 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/1751 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1751 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3363/5114 variables, 1751/1793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5114 variables, 3197/4990 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5114 variables, 0/4990 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/5115 variables, 1/4991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5115 variables, 0/4991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/5115 variables, 0/4991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5115/5115 variables, and 4991 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3415 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1752/1752 constraints, ReadFeed: 3197/3197 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1696/1735 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1735 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:42] [INFO ] Deduced a trap composed of 2 places in 1690 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:43] [INFO ] Deduced a trap composed of 43 places in 933 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:44] [INFO ] Deduced a trap composed of 43 places in 999 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:45] [INFO ] Deduced a trap composed of 43 places in 748 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:46] [INFO ] Deduced a trap composed of 43 places in 848 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:47] [INFO ] Deduced a trap composed of 43 places in 831 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:48] [INFO ] Deduced a trap composed of 43 places in 693 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:49] [INFO ] Deduced a trap composed of 43 places in 810 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:49] [INFO ] Deduced a trap composed of 43 places in 795 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:50] [INFO ] Deduced a trap composed of 43 places in 866 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:51] [INFO ] Deduced a trap composed of 43 places in 864 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:52] [INFO ] Deduced a trap composed of 43 places in 705 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:53] [INFO ] Deduced a trap composed of 43 places in 837 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:54] [INFO ] Deduced a trap composed of 43 places in 604 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:54] [INFO ] Deduced a trap composed of 43 places in 584 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:55] [INFO ] Deduced a trap composed of 43 places in 778 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:56] [INFO ] Deduced a trap composed of 43 places in 604 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:56] [INFO ] Deduced a trap composed of 43 places in 422 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:57] [INFO ] Deduced a trap composed of 43 places in 589 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:57] [INFO ] Deduced a trap composed of 43 places in 485 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1735 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:58] [INFO ] Deduced a trap composed of 43 places in 637 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:59] [INFO ] Deduced a trap composed of 44 places in 661 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:59] [INFO ] Deduced a trap composed of 44 places in 692 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:00] [INFO ] Deduced a trap composed of 44 places in 500 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:01] [INFO ] Deduced a trap composed of 44 places in 598 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:01] [INFO ] Deduced a trap composed of 44 places in 507 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:02] [INFO ] Deduced a trap composed of 44 places in 650 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:02] [INFO ] Deduced a trap composed of 44 places in 381 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:03] [INFO ] Deduced a trap composed of 44 places in 427 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:03] [INFO ] Deduced a trap composed of 43 places in 403 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:04] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:04] [INFO ] Deduced a trap composed of 43 places in 651 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:05] [INFO ] Deduced a trap composed of 43 places in 586 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:06] [INFO ] Deduced a trap composed of 43 places in 794 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:07] [INFO ] Deduced a trap composed of 43 places in 651 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:07] [INFO ] Deduced a trap composed of 43 places in 539 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:08] [INFO ] Deduced a trap composed of 43 places in 629 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:09] [INFO ] Deduced a trap composed of 43 places in 685 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:09] [INFO ] Deduced a trap composed of 43 places in 560 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:10] [INFO ] Deduced a trap composed of 43 places in 562 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1735 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:11] [INFO ] Deduced a trap composed of 43 places in 656 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:11] [INFO ] Deduced a trap composed of 44 places in 614 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:12] [INFO ] Deduced a trap composed of 43 places in 564 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:12] [INFO ] Deduced a trap composed of 43 places in 518 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:13] [INFO ] Deduced a trap composed of 43 places in 565 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:14] [INFO ] Deduced a trap composed of 43 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-31 02:51:14] [INFO ] Deduced a trap composed of 43 places in 598 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:15] [INFO ] Deduced a trap composed of 43 places in 559 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:15] [INFO ] Deduced a trap composed of 43 places in 494 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:16] [INFO ] Deduced a trap composed of 43 places in 499 ms of which 38 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1735 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:16] [INFO ] Deduced a trap composed of 43 places in 386 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:17] [INFO ] Deduced a trap composed of 43 places in 506 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:17] [INFO ] Deduced a trap composed of 43 places in 476 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:18] [INFO ] Deduced a trap composed of 43 places in 502 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:19] [INFO ] Deduced a trap composed of 43 places in 502 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:19] [INFO ] Deduced a trap composed of 43 places in 503 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:20] [INFO ] Deduced a trap composed of 43 places in 502 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:20] [INFO ] Deduced a trap composed of 43 places in 534 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:21] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:21] [INFO ] Deduced a trap composed of 43 places in 487 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:22] [INFO ] Deduced a trap composed of 43 places in 494 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:22] [INFO ] Deduced a trap composed of 43 places in 501 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:23] [INFO ] Deduced a trap composed of 43 places in 452 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:23] [INFO ] Deduced a trap composed of 43 places in 452 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:24] [INFO ] Deduced a trap composed of 43 places in 441 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:24] [INFO ] Deduced a trap composed of 43 places in 457 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:25] [INFO ] Deduced a trap composed of 43 places in 379 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:26] [INFO ] Deduced a trap composed of 43 places in 477 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1735 variables, 18/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:26] [INFO ] Deduced a trap composed of 43 places in 647 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1735 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:27] [INFO ] Deduced a trap composed of 43 places in 518 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1735 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:28] [INFO ] Deduced a trap composed of 43 places in 522 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:29] [INFO ] Deduced a trap composed of 43 places in 722 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:29] [INFO ] Deduced a trap composed of 43 places in 636 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:30] [INFO ] Deduced a trap composed of 43 places in 616 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:30] [INFO ] Deduced a trap composed of 43 places in 332 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:31] [INFO ] Deduced a trap composed of 44 places in 480 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:32] [INFO ] Deduced a trap composed of 43 places in 620 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:32] [INFO ] Deduced a trap composed of 43 places in 552 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:33] [INFO ] Deduced a trap composed of 44 places in 533 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:33] [INFO ] Deduced a trap composed of 43 places in 547 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:34] [INFO ] Deduced a trap composed of 44 places in 529 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:35] [INFO ] Deduced a trap composed of 43 places in 514 ms of which 51 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:35] [INFO ] Deduced a trap composed of 43 places in 453 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:36] [INFO ] Deduced a trap composed of 43 places in 478 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/1751 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:44] [INFO ] Deduced a trap composed of 43 places in 7967 ms of which 5903 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:50] [INFO ] Deduced a trap composed of 43 places in 5893 ms of which 4191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:53] [INFO ] Deduced a trap composed of 43 places in 2902 ms of which 808 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:57] [INFO ] Deduced a trap composed of 43 places in 3580 ms of which 1496 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:01] [INFO ] Deduced a trap composed of 43 places in 4268 ms of which 2278 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:05] [INFO ] Deduced a trap composed of 43 places in 4198 ms of which 2430 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:07] [INFO ] Deduced a trap composed of 43 places in 2102 ms of which 514 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:10] [INFO ] Deduced a trap composed of 43 places in 2033 ms of which 367 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:12] [INFO ] Deduced a trap composed of 43 places in 2823 ms of which 1033 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:15] [INFO ] Deduced a trap composed of 43 places in 2158 ms of which 504 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:17] [INFO ] Deduced a trap composed of 43 places in 2302 ms of which 756 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:19] [INFO ] Deduced a trap composed of 43 places in 2136 ms of which 305 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:21] [INFO ] Deduced a trap composed of 43 places in 2077 ms of which 525 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:24] [INFO ] Deduced a trap composed of 43 places in 2475 ms of which 612 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:26] [INFO ] Deduced a trap composed of 43 places in 2128 ms of which 638 ms to minimize.
SMT process timed out in 109076ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 39 out of 1752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1752/1752 places, 3363/3363 transitions.
Applied a total of 0 rules in 305 ms. Remains 1752 /1752 variables (removed 0) and now considering 3363/3363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 1752/1752 places, 3363/3363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1752/1752 places, 3363/3363 transitions.
Applied a total of 0 rules in 393 ms. Remains 1752 /1752 variables (removed 0) and now considering 3363/3363 (removed 0) transitions.
[2025-05-31 02:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:52:29] [INFO ] Implicit Places using invariants in 2655 ms returned []
[2025-05-31 02:52:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:52:31] [INFO ] State equation strengthened by 3197 read => feed constraints.
[2025-05-31 02:53:02] [INFO ] Performed 730/1752 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,8 properties remain. new max is 262144
SDD size :11123 after 14228
[2025-05-31 02:53:32] [INFO ] Performed 1447/1752 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-05-31 02:53:45] [INFO ] Implicit Places using invariants and state equation in 75410 ms returned []
Implicit Place search using SMT with State Equation took 78068 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:53:45] [INFO ] Redundant transitions in 528 ms returned []
Running 3323 sub problems to find dead transitions.
[2025-05-31 02:53:45] [INFO ] Invariant cache hit.
[2025-05-31 02:53:45] [INFO ] State equation strengthened by 3197 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1751 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3323 unsolved
SMT process timed out in 32367ms, After SMT, problems are : Problem set: 0 solved, 3323 unsolved
Search for dead transitions found 0 dead transitions in 32400ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111431 ms. Remains : 1752/1752 places, 3363/3363 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3113 edges and 1752 vertex of which 1411 / 1752 are part of one of the 35 SCC in 5 ms
Free SCC test removed 1376 places
Drop transitions (Empty/Sink Transition effects.) removed 2717 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 2750 transitions.
Graph (complete) has 758 edges and 376 vertex of which 303 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 303 transition count 368
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 1 with 335 rules applied. Total rules applied 550 place count 152 transition count 184
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 75 rules applied. Total rules applied 625 place count 114 transition count 147
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 625 place count 114 transition count 138
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 643 place count 105 transition count 138
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 647 place count 101 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 651 place count 101 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 101 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 656 place count 99 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 659 place count 99 transition count 128
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 666 place count 99 transition count 121
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 673 place count 92 transition count 121
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 689 place count 92 transition count 121
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 704 place count 77 transition count 106
Iterating global reduction 5 with 15 rules applied. Total rules applied 719 place count 77 transition count 106
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 724 place count 72 transition count 101
Applied a total of 724 rules in 88 ms. Remains 72 /1752 variables (removed 1680) and now considering 101/3363 (removed 3262) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 72 cols
[2025-05-31 02:54:18] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:54:18] [INFO ] After 155ms 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-31 02:54:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 02:54:18] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 02:54:18] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 02:54:18] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 02:54:18] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 02:54:18] [INFO ] Flatten gal took : 9 ms
[2025-05-31 02:54:18] [INFO ] Flatten gal took : 4 ms
[2025-05-31 02:54:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9844386589956000770.gal : 2 ms
[2025-05-31 02:54:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2578289750166812162.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/ReachabilityCardinality9844386589956000770.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2578289750166812162.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 ...328
Loading property file /tmp/ReachabilityCardinality2578289750166812162.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 3456
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3456 after 124416
Detected timeout of ITS tools.
[2025-05-31 02:54:33] [INFO ] Flatten gal took : 4 ms
[2025-05-31 02:54:33] [INFO ] Applying decomposition
[2025-05-31 02:54:33] [INFO ] Flatten gal took : 3 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/graph11013977241506763464.txt' '-o' '/tmp/graph11013977241506763464.bin' '-w' '/tmp/graph11013977241506763464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11013977241506763464.bin' '-l' '-1' '-v' '-w' '/tmp/graph11013977241506763464.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:54:34] [INFO ] Decomposing Gal with order
[2025-05-31 02:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:54:34] [INFO ] Removed a total of 3 redundant transitions.
[2025-05-31 02:54:34] [INFO ] Flatten gal took : 61 ms
[2025-05-31 02:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-05-31 02:54:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7432122693883372715.gal : 3 ms
[2025-05-31 02:54:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4301995614958106919.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/ReachabilityCardinality7432122693883372715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4301995614958106919.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 ...328
Loading property file /tmp/ReachabilityCardinality4301995614958106919.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 24
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :24 after 216
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :216 after 14688
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31036 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 02:54:49] [INFO ] Flatten gal took : 347 ms
[2025-05-31 02:54:49] [INFO ] Applying decomposition
[2025-05-31 02:54:50] [INFO ] Flatten gal took : 306 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/graph16200886269136011140.txt' '-o' '/tmp/graph16200886269136011140.bin' '-w' '/tmp/graph16200886269136011140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16200886269136011140.bin' '-l' '-1' '-v' '-w' '/tmp/graph16200886269136011140.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:54:51] [INFO ] Decomposing Gal with order
[2025-05-31 02:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:54:52] [INFO ] Removed a total of 3314 redundant transitions.
[2025-05-31 02:54:52] [INFO ] Flatten gal took : 576 ms
[2025-05-31 02:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 553 labels/synchronizations in 284 ms.
[2025-05-31 02:54:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8317108295154325327.gal : 80 ms
[2025-05-31 02:54:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7002208746238169661.prop : 4 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/ReachabilityCardinality8317108295154325327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7002208746238169661.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 ...328
Loading property file /tmp/ReachabilityCardinality7002208746238169661.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 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 46
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :46 after 51
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :51 after 55
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :55 after 57
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :57 after 61
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :61 after 67
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :67 after 114
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :114 after 2997
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2997 after 4198
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4198 after 109655
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :109655 after 121117
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :121117 after 132774
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :132774 after 2.63876e+06
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.63876e+06 after 2.79686e+06
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :2.79686e+06 after 4.19581e+07
SDD proceeding with computation,2 properties remain. new max is 2097152
SDD size :4.19581e+07 after 4.49402e+07
Detected timeout of ITS tools.
[2025-05-31 03:25:00] [INFO ] Flatten gal took : 1967 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13942891250176615503
[2025-05-31 03:25:01] [INFO ] Too many transitions (3363) to apply POR reductions. Disabling POR matrices.
[2025-05-31 03:25:01] [INFO ] Applying decomposition
[2025-05-31 03:25:02] [INFO ] Built C files in 1584ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13942891250176615503
Running compilation step : cd /tmp/ltsmin13942891250176615503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-31 03:25:03] [INFO ] Flatten gal took : 1689 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/graph1546141769662475411.txt' '-o' '/tmp/graph1546141769662475411.bin' '-w' '/tmp/graph1546141769662475411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1546141769662475411.bin' '-l' '-1' '-v' '-w' '/tmp/graph1546141769662475411.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:25:08] [INFO ] Decomposing Gal with order
[2025-05-31 03:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:25:11] [INFO ] Removed a total of 3345 redundant transitions.
[2025-05-31 03:25:12] [INFO ] Flatten gal took : 2464 ms
[2025-05-31 03:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 3027 labels/synchronizations in 548 ms.
[2025-05-31 03:25:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8120427606837563289.gal : 51 ms
[2025-05-31 03:25:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14020806033303356929.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/ReachabilityCardinality8120427606837563289.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14020806033303356929.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/ReachabilityCardinality14020806033303356929.prop.
Compilation finished in 17336 ms.
Running link step : cd /tmp/ltsmin13942891250176615503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin13942891250176615503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT040ReachabilityCardinality202512==true'
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 186
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :186 after 223
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :223 after 224
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :224 after 266
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :266 after 351
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :351 after 477
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :477 after 11352
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :11352 after 252624
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13942891250176615503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT040ReachabilityCardinality202512==true'
Running LTSmin : cd /tmp/ltsmin13942891250176615503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT040ReachabilityCardinality202514==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
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="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r030-smll-174853813500198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 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 ;