Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000285.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 ASLink-PT-01a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 201K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748566371137

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 00:52:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 00:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:52:52] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-05-30 00:52:52] [INFO ] Transformed 431 places.
[2025-05-30 00:52:52] [INFO ] Transformed 735 transitions.
[2025-05-30 00:52:52] [INFO ] Found NUPN structural information;
[2025-05-30 00:52:52] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 728 rows 431 cols
[2025-05-30 00:52:52] [INFO ] Computed 80 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (177 resets) in 66 ms. (149 steps per ms)
FORMULA ASLink-PT-01a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (267 resets) in 84 ms. (470 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-30 00:52:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:52:53] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2025-05-30 00:52:53] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 23 ms returned sat
[2025-05-30 00:52:53] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-30 00:52:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:52:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-05-30 00:52:53] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 20 ms returned sat
[2025-05-30 00:52:53] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-05-30 00:52:53] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 63 ms.
[2025-05-30 00:52:56] [INFO ] Added : 199 causal constraints over 40 iterations in 2363 ms. Result :sat
Minimization took 503 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:52:56] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2025-05-30 00:52:56] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 21 ms returned sat
[2025-05-30 00:52:56] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-30 00:52:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:52:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2025-05-30 00:52:57] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 18 ms returned sat
[2025-05-30 00:52:57] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-05-30 00:52:57] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 63 ms.
[2025-05-30 00:52:59] [INFO ] Added : 105 causal constraints over 21 iterations in 1917 ms. Result :sat
Minimization took 509 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:53:00] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-30 00:53:00] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 18 ms returned sat
[2025-05-30 00:53:00] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-05-30 00:53:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:53:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-30 00:53:00] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 31 ms returned sat
[2025-05-30 00:53:00] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:53:00] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 25 ms to minimize.
[2025-05-30 00:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2025-05-30 00:53:00] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 39 ms.
[2025-05-30 00:53:02] [INFO ] Added : 100 causal constraints over 20 iterations in 1525 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:53:03] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-30 00:53:03] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 18 ms returned sat
[2025-05-30 00:53:03] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-05-30 00:53:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 00:53:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-30 00:53:03] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 21 ms returned sat
[2025-05-30 00:53:03] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-05-30 00:53:03] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:53:06] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 16 ms to minimize.
[2025-05-30 00:53:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2025-05-30 00:53:06] [INFO ] Added : 194 causal constraints over 39 iterations in 3165 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 425 transition count 696
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 393 transition count 696
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 70 place count 393 transition count 667
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 139 place count 353 transition count 667
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 2 with 1 rules applied. Total rules applied 140 place count 353 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 352 transition count 666
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 144 place count 349 transition count 650
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 349 transition count 650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 4 rules applied. Total rules applied 151 place count 348 transition count 647
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 153 place count 346 transition count 647
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 345 transition count 639
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 345 transition count 639
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 344 transition count 631
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 344 transition count 631
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 343 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 343 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 599
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 591
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 583
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 575
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 567
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 567
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 559
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 559
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 551
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 551
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 543
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 543
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 535
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 527
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 527
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 330 transition count 519
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 330 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 199 place count 323 transition count 512
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 201 place count 323 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 322 transition count 511
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 204 place count 320 transition count 511
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 204 place count 320 transition count 507
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 213 place count 315 transition count 507
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 215 place count 313 transition count 507
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 215 place count 313 transition count 506
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 217 place count 312 transition count 506
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 221 place count 310 transition count 504
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 222 place count 309 transition count 503
Iterating global reduction 8 with 1 rules applied. Total rules applied 223 place count 309 transition count 503
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 224 place count 309 transition count 502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 225 place count 308 transition count 502
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 226 place count 308 transition count 502
Applied a total of 226 rules in 343 ms. Remains 308 /431 variables (removed 123) and now considering 502/728 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 308/431 places, 502/728 transitions.
// Phase 1: matrix 502 rows 308 cols
[2025-05-30 00:53:07] [INFO ] Computed 57 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (21408 resets) in 1525 ms. (655 steps per ms)
FORMULA ASLink-PT-01a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (9325 resets) in 795 ms. (1256 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 00:53:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 00:53:10] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-30 00:53:10] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 9 ms returned sat
[2025-05-30 00:53:10] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-30 00:53:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 00:53:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-30 00:53:10] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 8 ms returned sat
[2025-05-30 00:53:10] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:53:10] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 30 ms to minimize.
[2025-05-30 00:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2025-05-30 00:53:10] [INFO ] Computed and/alt/rep : 182/749/182 causal constraints (skipped 307 transitions) in 24 ms.
[2025-05-30 00:53:11] [INFO ] Added : 121 causal constraints over 25 iterations in 951 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 308 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p212) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 493/493 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 1273 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 492
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 491
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 304 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 2 rules applied. Total rules applied 7 place count 304 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 303 transition count 489
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 303 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 302 transition count 488
Applied a total of 10 rules in 39 ms. Remains 302 /308 variables (removed 6) and now considering 488/493 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 302/308 places, 488/493 transitions.
// Phase 1: matrix 488 rows 302 cols
[2025-05-30 00:53:12] [INFO ] Computed 55 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21349 resets) in 1339 ms. (746 steps per ms)
BEST_FIRST walk for 1000001 steps (9351 resets) in 746 ms. (1338 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 00:53:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 00:53:14] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-30 00:53:14] [INFO ] [Real]Absence check using 15 positive and 40 generalized place invariants in 9 ms returned sat
[2025-05-30 00:53:14] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-05-30 00:53:14] [INFO ] Computed and/alt/rep : 178/725/178 causal constraints (skipped 297 transitions) in 27 ms.
[2025-05-30 00:53:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 00:53:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-30 00:53:14] [INFO ] [Nat]Absence check using 15 positive and 40 generalized place invariants in 8 ms returned sat
[2025-05-30 00:53:14] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-05-30 00:53:14] [INFO ] Computed and/alt/rep : 178/725/178 causal constraints (skipped 297 transitions) in 30 ms.
[2025-05-30 00:53:15] [INFO ] Added : 48 causal constraints over 10 iterations in 398 ms. Result :sat
Minimization took 211 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 488/488 transitions.
Applied a total of 0 rules in 16 ms. Remains 302 /302 variables (removed 0) and now considering 488/488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 302/302 places, 488/488 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 488/488 transitions.
Applied a total of 0 rules in 10 ms. Remains 302 /302 variables (removed 0) and now considering 488/488 (removed 0) transitions.
[2025-05-30 00:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:15] [INFO ] Implicit Places using invariants in 292 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 170, 173, 191, 192, 193, 194, 206, 212, 218, 224, 230, 236, 242, 248, 254, 260, 266]
[2025-05-30 00:53:15] [INFO ] Actually due to overlaps returned [168, 139, 150, 30, 48, 173, 149, 192, 148, 170, 191, 0, 18, 19, 66, 194, 236, 254, 266, 193, 206, 212, 218, 224, 230, 242, 248, 260]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 299 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 274/302 places, 488/488 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 273 transition count 441
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 226 transition count 441
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 95 place count 226 transition count 430
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 118 place count 214 transition count 430
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 130 place count 210 transition count 422
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 138 place count 202 transition count 422
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 153 place count 187 transition count 407
Iterating global reduction 4 with 15 rules applied. Total rules applied 168 place count 187 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 171 place count 187 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 171 place count 187 transition count 403
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 173 place count 186 transition count 403
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 176 place count 183 transition count 400
Iterating global reduction 5 with 3 rules applied. Total rules applied 179 place count 183 transition count 400
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 182 transition count 399
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 182 transition count 399
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 181 transition count 398
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 181 transition count 398
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 217 place count 164 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 164 transition count 380
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 219 place count 163 transition count 379
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 163 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 163 transition count 378
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 163 transition count 377
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 224 place count 161 transition count 377
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 227 place count 161 transition count 377
Applied a total of 227 rules in 56 ms. Remains 161 /274 variables (removed 113) and now considering 377/488 (removed 111) transitions.
// Phase 1: matrix 377 rows 161 cols
[2025-05-30 00:53:15] [INFO ] Computed 20 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:15] [INFO ] Implicit Places using invariants in 134 ms returned [72, 89, 95, 98, 100]
[2025-05-30 00:53:15] [INFO ] Actually due to overlaps returned [89, 95, 100, 72]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 136 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/302 places, 377/488 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 153 transition count 373
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 153 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 152 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 152 transition count 372
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 0 with 4 rules applied. Total rules applied 14 place count 150 transition count 370
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 150 transition count 367
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 147 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 366
Applied a total of 22 rules in 27 ms. Remains 146 /157 variables (removed 11) and now considering 366/377 (removed 11) transitions.
// Phase 1: matrix 366 rows 146 cols
[2025-05-30 00:53:16] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 00:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:16] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 146/302 places, 366/488 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 883 ms. Remains : 146/302 places, 366/488 transitions.
[2025-05-30 00:53:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (28970 resets) in 969 ms. (1030 steps per ms)
BEST_FIRST walk for 1000001 steps (15501 resets) in 614 ms. (1626 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 00:53:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 00:53:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-30 00:53:17] [INFO ] [Real]Absence check using 7 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-30 00:53:18] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-05-30 00:53:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 00:53:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-30 00:53:18] [INFO ] [Nat]Absence check using 7 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-30 00:53:18] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-30 00:53:18] [INFO ] Computed and/alt/rep : 69/390/69 causal constraints (skipped 287 transitions) in 19 ms.
[2025-05-30 00:53:18] [INFO ] Added : 7 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 366/366 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 146/146 places, 366/366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 366/366 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2025-05-30 00:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:18] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-30 00:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:18] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:53:18] [INFO ] Redundant transitions in 24 ms returned []
Running 356 sub problems to find dead transitions.
[2025-05-30 00:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 2/146 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:53:24] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 366/512 variables, 146/163 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:53:30] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 10 (OVERLAPS) 0/512 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 164 constraints, problems are : Problem set: 0 solved, 356 unsolved in 26547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 2/146 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 7 (OVERLAPS) 366/512 variables, 146/164 constraints. Problems are: Problem set: 145 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 375 constraints, problems are : Problem set: 145 solved, 211 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 211/356 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56811ms problems are : Problem set: 145 solved, 211 unsolved
Search for dead transitions found 145 dead transitions in 56820ms
Found 145 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 145 transitions
Dead transitions reduction (with SMT) removed 145 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 146/146 places, 221/366 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:54:15] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57274 ms. Remains : 146/146 places, 221/366 transitions.
// Phase 1: matrix 221 rows 146 cols
[2025-05-30 00:54:15] [INFO ] Computed 16 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (29089 resets) in 919 ms. (1086 steps per ms)
FORMULA ASLink-PT-01a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (15557 resets) in 506 ms. (1972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-30 00:54:17] [INFO ] Flatten gal took : 90 ms
[2025-05-30 00:54:17] [INFO ] Flatten gal took : 46 ms
[2025-05-30 00:54:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2693683973146115103.gal : 9 ms
[2025-05-30 00:54:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12474160556123875169.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/ReachabilityCardinality2693683973146115103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12474160556123875169.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 85331 ms.

BK_STOP 1748566457755

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

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