Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 436K 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-04a-UpperBounds-00
FORMULA_NAME ASLink-PT-04a-UpperBounds-01
FORMULA_NAME ASLink-PT-04a-UpperBounds-02
FORMULA_NAME ASLink-PT-04a-UpperBounds-03
FORMULA_NAME ASLink-PT-04a-UpperBounds-04
FORMULA_NAME ASLink-PT-04a-UpperBounds-05
FORMULA_NAME ASLink-PT-04a-UpperBounds-06
FORMULA_NAME ASLink-PT-04a-UpperBounds-07
FORMULA_NAME ASLink-PT-04a-UpperBounds-08
FORMULA_NAME ASLink-PT-04a-UpperBounds-09
FORMULA_NAME ASLink-PT-04a-UpperBounds-10
FORMULA_NAME ASLink-PT-04a-UpperBounds-11
FORMULA_NAME ASLink-PT-04a-UpperBounds-12
FORMULA_NAME ASLink-PT-04a-UpperBounds-13
FORMULA_NAME ASLink-PT-04a-UpperBounds-14
FORMULA_NAME ASLink-PT-04a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748577319037

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-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 03:55:20] [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 03:55:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:55:20] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-05-30 03:55:20] [INFO ] Transformed 1016 places.
[2025-05-30 03:55:20] [INFO ] Transformed 1554 transitions.
[2025-05-30 03:55:20] [INFO ] Found NUPN structural information;
[2025-05-30 03:55:20] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 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 1538 rows 1016 cols
[2025-05-30 03:55:20] [INFO ] Computed 194 invariants in 83 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 (68 resets) in 77 ms. (128 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (51 resets) in 90 ms. (439 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 03:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 03:55:21] [INFO ] [Real]Absence check using 46 positive place invariants in 32 ms returned sat
[2025-05-30 03:55:21] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 47 ms returned sat
[2025-05-30 03:55:21] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-05-30 03:55:21] [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 03:55:22] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2025-05-30 03:55:22] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 43 ms returned sat
[2025-05-30 03:55:22] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:22] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 39 ms to minimize.
[2025-05-30 03:55:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2025-05-30 03:55:23] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 96 ms.
[2025-05-30 03:55:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 03:55:27] [INFO ] [Real]Absence check using 46 positive place invariants in 21 ms returned sat
[2025-05-30 03:55:27] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 62 ms returned sat
[2025-05-30 03:55:27] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2025-05-30 03:55:27] [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 03:55:27] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2025-05-30 03:55:27] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 42 ms returned sat
[2025-05-30 03:55:28] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2025-05-30 03:55:28] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 98 ms.
[2025-05-30 03:55:32] [INFO ] Added : 260 causal constraints over 52 iterations in 4327 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 03:55:32] [INFO ] [Real]Absence check using 46 positive place invariants in 21 ms returned sat
[2025-05-30 03:55:32] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 43 ms returned sat
[2025-05-30 03:55:33] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2025-05-30 03:55:33] [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 03:55:33] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2025-05-30 03:55:33] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 39 ms returned sat
[2025-05-30 03:55:34] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:34] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 16 ms to minimize.
[2025-05-30 03:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2025-05-30 03:55:34] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 83 ms.
[2025-05-30 03:55:38] [INFO ] Added : 245 causal constraints over 49 iterations in 4102 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 03:55:38] [INFO ] [Real]Absence check using 46 positive place invariants in 20 ms returned sat
[2025-05-30 03:55:38] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 42 ms returned sat
[2025-05-30 03:55:39] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2025-05-30 03:55:39] [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 03:55:39] [INFO ] [Nat]Absence check using 46 positive place invariants in 21 ms returned sat
[2025-05-30 03:55:39] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 40 ms returned sat
[2025-05-30 03:55:39] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-05-30 03:55:39] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 81 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 992 transition count 1449
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 202 place count 903 transition count 1449
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 202 place count 903 transition count 1360
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 35 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 415 place count 779 transition count 1360
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 416 place count 779 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 417 place count 778 transition count 1359
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 424 place count 771 transition count 1324
Ensure Unique test removed 1 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 432 place count 770 transition count 1324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 rules applied. Total rules applied 437 place count 769 transition count 1320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 439 place count 767 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 440 place count 766 transition count 1312
Iterating global reduction 6 with 1 rules applied. Total rules applied 441 place count 766 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 442 place count 765 transition count 1304
Iterating global reduction 6 with 1 rules applied. Total rules applied 443 place count 765 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 444 place count 764 transition count 1296
Iterating global reduction 6 with 1 rules applied. Total rules applied 445 place count 764 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 446 place count 763 transition count 1288
Iterating global reduction 6 with 1 rules applied. Total rules applied 447 place count 763 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 448 place count 762 transition count 1280
Iterating global reduction 6 with 1 rules applied. Total rules applied 449 place count 762 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 450 place count 761 transition count 1272
Iterating global reduction 6 with 1 rules applied. Total rules applied 451 place count 761 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 452 place count 760 transition count 1264
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 760 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 454 place count 759 transition count 1256
Iterating global reduction 6 with 1 rules applied. Total rules applied 455 place count 759 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 456 place count 758 transition count 1248
Iterating global reduction 6 with 1 rules applied. Total rules applied 457 place count 758 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 458 place count 757 transition count 1240
Iterating global reduction 6 with 1 rules applied. Total rules applied 459 place count 757 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 460 place count 756 transition count 1232
Iterating global reduction 6 with 1 rules applied. Total rules applied 461 place count 756 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 462 place count 755 transition count 1224
Iterating global reduction 6 with 1 rules applied. Total rules applied 463 place count 755 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 464 place count 754 transition count 1216
Iterating global reduction 6 with 1 rules applied. Total rules applied 465 place count 754 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 466 place count 753 transition count 1208
Iterating global reduction 6 with 1 rules applied. Total rules applied 467 place count 753 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 468 place count 752 transition count 1200
Iterating global reduction 6 with 1 rules applied. Total rules applied 469 place count 752 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 470 place count 751 transition count 1192
Iterating global reduction 6 with 1 rules applied. Total rules applied 471 place count 751 transition count 1192
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 527 place count 723 transition count 1164
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 530 place count 723 transition count 1161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 533 place count 720 transition count 1161
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 538 place count 720 transition count 1161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 539 place count 719 transition count 1160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 547 place count 711 transition count 1160
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 547 place count 711 transition count 1144
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 33 rules applied. Total rules applied 580 place count 694 transition count 1144
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 585 place count 689 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 585 place count 689 transition count 1143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 587 place count 688 transition count 1143
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 597 place count 683 transition count 1138
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 601 place count 679 transition count 1134
Iterating global reduction 9 with 4 rules applied. Total rules applied 605 place count 679 transition count 1134
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 609 place count 679 transition count 1130
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 613 place count 675 transition count 1130
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 617 place count 675 transition count 1130
Applied a total of 617 rules in 998 ms. Remains 675 /1016 variables (removed 341) and now considering 1130/1538 (removed 408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1005 ms. Remains : 675/1016 places, 1130/1538 transitions.
// Phase 1: matrix 1130 rows 675 cols
[2025-05-30 03:55:48] [INFO ] Computed 119 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (12901 resets) in 2169 ms. (460 steps per ms)
BEST_FIRST walk for 2000002 steps (5866 resets) in 1997 ms. (1001 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-30 03:55:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:55:52] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2025-05-30 03:55:52] [INFO ] [Real]Absence check using 30 positive and 89 generalized place invariants in 21 ms returned sat
[2025-05-30 03:55:53] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2025-05-30 03:55:53] [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 03:55:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2025-05-30 03:55:53] [INFO ] [Nat]Absence check using 30 positive and 89 generalized place invariants in 19 ms returned sat
[2025-05-30 03:55:53] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-05-30 03:55:53] [INFO ] Computed and/alt/rep : 438/1693/438 causal constraints (skipped 667 transitions) in 50 ms.
[2025-05-30 03:55:58] [INFO ] Added : 313 causal constraints over 63 iterations in 4594 ms. Result :sat
Minimization took 547 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:55:58] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2025-05-30 03:55:58] [INFO ] [Real]Absence check using 30 positive and 89 generalized place invariants in 21 ms returned sat
[2025-05-30 03:55:59] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2025-05-30 03:55:59] [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 03:55:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2025-05-30 03:55:59] [INFO ] [Nat]Absence check using 30 positive and 89 generalized place invariants in 16 ms returned sat
[2025-05-30 03:55:59] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-05-30 03:55:59] [INFO ] Computed and/alt/rep : 438/1693/438 causal constraints (skipped 667 transitions) in 65 ms.
[2025-05-30 03:56:04] [INFO ] Added : 354 causal constraints over 71 iterations in 4523 ms. Result :sat
Minimization took 587 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1130/1130 transitions.
Applied a total of 0 rules in 24 ms. Remains 675 /675 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 675/675 places, 1130/1130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1130/1130 transitions.
Applied a total of 0 rules in 23 ms. Remains 675 /675 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
[2025-05-30 03:56:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:06] [INFO ] Implicit Places using invariants in 558 ms returned [0, 19, 20, 31, 49, 67, 136, 140, 149, 150, 151, 169, 187, 256, 260, 261, 272, 273, 274, 292, 310, 379, 383, 384, 395, 396, 397, 415, 433, 502, 506, 507, 510, 521, 522, 523, 541, 543, 546, 564, 565, 566, 567, 579, 585, 591, 597, 603, 609, 615, 621, 627, 633, 639]
[2025-05-30 03:56:06] [INFO ] Actually due to overlaps returned [541, 523, 31, 49, 151, 169, 274, 292, 397, 415, 546, 150, 273, 396, 522, 565, 149, 272, 395, 521, 543, 564, 0, 260, 261, 383, 384, 506, 507, 19, 20, 67, 187, 310, 433, 567, 609, 627, 639, 510, 566, 579, 585, 591, 597, 603, 615, 621, 633]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 563 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 626/675 places, 1130/1130 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 622 transition count 1040
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 185 place count 532 transition count 1039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 531 transition count 1039
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 186 place count 531 transition count 1016
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 233 place count 507 transition count 1016
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 3 with 12 rules applied. Total rules applied 245 place count 503 transition count 1008
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 253 place count 495 transition count 1008
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 268 place count 480 transition count 993
Iterating global reduction 5 with 15 rules applied. Total rules applied 283 place count 480 transition count 993
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 286 place count 480 transition count 990
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 286 place count 480 transition count 989
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 479 transition count 989
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 291 place count 476 transition count 986
Iterating global reduction 6 with 3 rules applied. Total rules applied 294 place count 476 transition count 986
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 295 place count 475 transition count 985
Iterating global reduction 6 with 1 rules applied. Total rules applied 296 place count 475 transition count 985
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 297 place count 474 transition count 984
Iterating global reduction 6 with 1 rules applied. Total rules applied 298 place count 474 transition count 984
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 376 place count 435 transition count 945
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 380 place count 435 transition count 941
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 384 place count 431 transition count 937
Iterating global reduction 7 with 4 rules applied. Total rules applied 388 place count 431 transition count 937
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 392 place count 431 transition count 933
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 401 place count 431 transition count 924
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 411 place count 421 transition count 924
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 424 place count 421 transition count 924
Applied a total of 424 rules in 257 ms. Remains 421 /626 variables (removed 205) and now considering 924/1130 (removed 206) transitions.
// Phase 1: matrix 924 rows 421 cols
[2025-05-30 03:56:06] [INFO ] Computed 60 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:06] [INFO ] Implicit Places using invariants in 308 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 158, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272, 277, 278, 330, 347, 353, 356, 358]
[2025-05-30 03:56:06] [INFO ] Actually due to overlaps returned [105, 191, 277, 106, 192, 278, 90, 96, 101, 102, 175, 181, 186, 261, 267, 272, 347, 353, 358, 73, 158, 244, 330]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 310 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 398/675 places, 924/1130 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 382 transition count 908
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 382 transition count 908
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 378 transition count 904
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 378 transition count 904
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 370 transition count 896
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 370 transition count 884
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 358 transition count 884
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 358 transition count 880
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 354 transition count 880
Applied a total of 88 rules in 63 ms. Remains 354 /398 variables (removed 44) and now considering 880/924 (removed 44) transitions.
// Phase 1: matrix 880 rows 354 cols
[2025-05-30 03:56:06] [INFO ] Computed 37 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:06] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-30 03:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:07] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 354/675 places, 880/1130 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2151 ms. Remains : 354/675 places, 880/1130 transitions.
[2025-05-30 03:56:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (19534 resets) in 1595 ms. (626 steps per ms)
BEST_FIRST walk for 2000002 steps (11473 resets) in 1402 ms. (1425 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-30 03:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:56:10] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-30 03:56:10] [INFO ] [Real]Absence check using 9 positive and 28 generalized place invariants in 7 ms returned sat
[2025-05-30 03:56:10] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-05-30 03:56: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 03:56:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-30 03:56:10] [INFO ] [Nat]Absence check using 9 positive and 28 generalized place invariants in 9 ms returned sat
[2025-05-30 03:56:11] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-05-30 03:56:11] [INFO ] Computed and/alt/rep : 177/849/177 causal constraints (skipped 681 transitions) in 48 ms.
[2025-05-30 03:56:11] [INFO ] Added : 29 causal constraints over 6 iterations in 501 ms. Result :sat
Minimization took 353 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:56:12] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-30 03:56:12] [INFO ] [Real]Absence check using 9 positive and 28 generalized place invariants in 7 ms returned sat
[2025-05-30 03:56:12] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-30 03:56:12] [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 03:56:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-30 03:56:12] [INFO ] [Nat]Absence check using 9 positive and 28 generalized place invariants in 7 ms returned sat
[2025-05-30 03:56:12] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2025-05-30 03:56:12] [INFO ] Computed and/alt/rep : 177/849/177 causal constraints (skipped 681 transitions) in 38 ms.
[2025-05-30 03:56:13] [INFO ] Added : 18 causal constraints over 4 iterations in 419 ms. Result :sat
Minimization took 326 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 880/880 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 880/880 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 354/354 places, 880/880 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 880/880 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 880/880 (removed 0) transitions.
[2025-05-30 03:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:13] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-30 03:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:14] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:56:14] [INFO ] Redundant transitions in 47 ms returned []
Running 858 sub problems to find dead transitions.
[2025-05-30 03:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 3 (OVERLAPS) 1/354 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 858 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:56:43] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/1234 variables, and 38 constraints, problems are : Problem set: 0 solved, 858 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/354 constraints, PredecessorRefiner: 858/858 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 858 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 3 (OVERLAPS) 1/354 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 858 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:56:59] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 39 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 858 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 858 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 8 (OVERLAPS) 880/1234 variables, 354/393 constraints. Problems are: Problem set: 5 solved, 853 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1246 constraints, problems are : Problem set: 5 solved, 853 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 853/858 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 5 solved, 853 unsolved
Search for dead transitions found 5 dead transitions in 60469ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/354 places, 875/880 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:57:15] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61507 ms. Remains : 354/354 places, 875/880 transitions.
// Phase 1: matrix 875 rows 354 cols
[2025-05-30 03:57:15] [INFO ] Computed 37 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (19477 resets) in 1598 ms. (625 steps per ms)
BEST_FIRST walk for 2000002 steps (11568 resets) in 1406 ms. (1421 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-30 03:57:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:57:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-30 03:57:18] [INFO ] [Real]Absence check using 8 positive and 29 generalized place invariants in 7 ms returned sat
[2025-05-30 03:57:18] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-05-30 03:57: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 03:57:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 03:57:18] [INFO ] [Nat]Absence check using 8 positive and 29 generalized place invariants in 7 ms returned sat
[2025-05-30 03:57:18] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-05-30 03:57:18] [INFO ] Computed and/alt/rep : 177/844/177 causal constraints (skipped 676 transitions) in 41 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:57:19] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 17 ms to minimize.
[2025-05-30 03:57:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2025-05-30 03:57:19] [INFO ] Added : 77 causal constraints over 16 iterations in 1298 ms. Result :sat
Minimization took 353 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:57:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 03:57:20] [INFO ] [Real]Absence check using 8 positive and 29 generalized place invariants in 7 ms returned sat
[2025-05-30 03:57:20] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-05-30 03:57:20] [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 03:57:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-30 03:57:20] [INFO ] [Nat]Absence check using 8 positive and 29 generalized place invariants in 7 ms returned sat
[2025-05-30 03:57:21] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-05-30 03:57:21] [INFO ] Computed and/alt/rep : 177/844/177 causal constraints (skipped 676 transitions) in 37 ms.
[2025-05-30 03:57:21] [INFO ] Added : 31 causal constraints over 7 iterations in 531 ms. Result :sat
Minimization took 285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 875/875 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 354/354 places, 875/875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 875/875 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 875/875 (removed 0) transitions.
[2025-05-30 03:57:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:57:22] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-30 03:57:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:57:23] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:57:23] [INFO ] Redundant transitions in 8 ms returned []
Running 853 sub problems to find dead transitions.
[2025-05-30 03:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:57:28] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 10 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:57:28] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 9 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/35 constraints. Problems are: Problem set: 10 solved, 843 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/35 constraints. Problems are: Problem set: 10 solved, 843 unsolved
At refinement iteration 4 (OVERLAPS) 1/354 variables, 3/38 constraints. Problems are: Problem set: 10 solved, 843 unsolved
SMT process timed out in 30224ms, After SMT, problems are : Problem set: 10 solved, 843 unsolved
Search for dead transitions found 10 dead transitions in 30227ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/354 places, 865/875 transitions.
Applied a total of 0 rules in 14 ms. Remains 354 /354 variables (removed 0) and now considering 865/865 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:57:53] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31239 ms. Remains : 354/354 places, 865/875 transitions.
// Phase 1: matrix 865 rows 354 cols
[2025-05-30 03:57:53] [INFO ] Computed 37 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (19501 resets) in 1559 ms. (641 steps per ms)
BEST_FIRST walk for 1000000 steps (5789 resets) in 690 ms. (1447 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 03:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:57:55] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-30 03:57:55] [INFO ] [Real]Absence check using 9 positive and 28 generalized place invariants in 7 ms returned sat
[2025-05-30 03:57:55] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-05-30 03:57:55] [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 03:57:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-30 03:57:56] [INFO ] [Nat]Absence check using 9 positive and 28 generalized place invariants in 7 ms returned sat
[2025-05-30 03:57:56] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2025-05-30 03:57:56] [INFO ] Computed and/alt/rep : 181/875/181 causal constraints (skipped 662 transitions) in 37 ms.
[2025-05-30 03:57:56] [INFO ] Added : 13 causal constraints over 3 iterations in 454 ms. Result :sat
Minimization took 333 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 354 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p19) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 864/864 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 863
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 861
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 351 transition count 860
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 350 transition count 859
Applied a total of 4 rules in 17 ms. Remains 350 /354 variables (removed 4) and now considering 859/864 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 350/354 places, 859/864 transitions.
// Phase 1: matrix 859 rows 350 cols
[2025-05-30 03:57:57] [INFO ] Computed 37 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (19612 resets) in 1570 ms. (636 steps per ms)
BEST_FIRST walk for 1000001 steps (5707 resets) in 701 ms. (1424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 03:57:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:57:59] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-30 03:57:59] [INFO ] [Real]Absence check using 10 positive and 27 generalized place invariants in 7 ms returned sat
[2025-05-30 03:57:59] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2025-05-30 03:57:59] [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 03:57:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-30 03:57:59] [INFO ] [Nat]Absence check using 10 positive and 27 generalized place invariants in 12 ms returned sat
[2025-05-30 03:58:00] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:00] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 6 ms to minimize.
[2025-05-30 03:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-05-30 03:58:00] [INFO ] Computed and/alt/rep : 175/851/175 causal constraints (skipped 662 transitions) in 36 ms.
[2025-05-30 03:58:00] [INFO ] Added : 20 causal constraints over 4 iterations in 532 ms. Result :sat
Minimization took 523 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 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 859/859 transitions.
Applied a total of 0 rules in 10 ms. Remains 350 /350 variables (removed 0) and now considering 859/859 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 350/350 places, 859/859 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 859/859 transitions.
Applied a total of 0 rules in 10 ms. Remains 350 /350 variables (removed 0) and now considering 859/859 (removed 0) transitions.
[2025-05-30 03:58:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:58:01] [INFO ] Implicit Places using invariants in 234 ms returned [18, 84]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/350 places, 859/859 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 348 transition count 852
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 341 transition count 852
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 2 with 4 rules applied. Total rules applied 18 place count 339 transition count 850
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 339 transition count 848
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 337 transition count 848
Applied a total of 22 rules in 28 ms. Remains 337 /348 variables (removed 11) and now considering 848/859 (removed 11) transitions.
// Phase 1: matrix 848 rows 337 cols
[2025-05-30 03:58:01] [INFO ] Computed 35 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:58:01] [INFO ] Implicit Places using invariants in 225 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 336/350 places, 848/859 transitions.
Applied a total of 0 rules in 10 ms. Remains 336 /336 variables (removed 0) and now considering 848/848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 510 ms. Remains : 336/350 places, 848/859 transitions.
// Phase 1: matrix 848 rows 336 cols
[2025-05-30 03:58:01] [INFO ] Computed 34 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (19848 resets) in 1561 ms. (640 steps per ms)
BEST_FIRST walk for 1000000 steps (5872 resets) in 682 ms. (1464 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 03:58:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:58:04] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-30 03:58:04] [INFO ] [Real]Absence check using 11 positive and 23 generalized place invariants in 5 ms returned sat
[2025-05-30 03:58:04] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-05-30 03:58:04] [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 03:58:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-30 03:58:04] [INFO ] [Nat]Absence check using 11 positive and 23 generalized place invariants in 6 ms returned sat
[2025-05-30 03:58:04] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2025-05-30 03:58:04] [INFO ] Computed and/alt/rep : 164/842/164 causal constraints (skipped 662 transitions) in 38 ms.
[2025-05-30 03:58:05] [INFO ] Added : 18 causal constraints over 4 iterations in 300 ms. Result :sat
Minimization took 373 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 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 848/848 transitions.
Applied a total of 0 rules in 9 ms. Remains 336 /336 variables (removed 0) and now considering 848/848 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 336/336 places, 848/848 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 848/848 transitions.
Applied a total of 0 rules in 9 ms. Remains 336 /336 variables (removed 0) and now considering 848/848 (removed 0) transitions.
[2025-05-30 03:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:58:05] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-30 03:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:58:06] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:58:06] [INFO ] Redundant transitions in 8 ms returned []
Running 826 sub problems to find dead transitions.
[2025-05-30 03:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 826 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:11] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 14 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:11] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 14 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:11] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 14 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 3/26 constraints. Problems are: Problem set: 10 solved, 816 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/26 constraints. Problems are: Problem set: 10 solved, 816 unsolved
At refinement iteration 4 (OVERLAPS) 2/336 variables, 5/31 constraints. Problems are: Problem set: 10 solved, 816 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 6/37 constraints. Problems are: Problem set: 10 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:35] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 13 ms to minimize.
Problem TDEAD212 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:35] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 13 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD308 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/1184 variables, and 39 constraints, problems are : Problem set: 23 solved, 803 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/336 constraints, PredecessorRefiner: 826/826 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 6/6 constraints. Problems are: Problem set: 23 solved, 803 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 17/23 constraints. Problems are: Problem set: 23 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 3/26 constraints. Problems are: Problem set: 23 solved, 803 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/26 constraints. Problems are: Problem set: 23 solved, 803 unsolved
At refinement iteration 4 (OVERLAPS) 2/336 variables, 5/31 constraints. Problems are: Problem set: 23 solved, 803 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 6/37 constraints. Problems are: Problem set: 23 solved, 803 unsolved
Problem TDEAD751 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 2/39 constraints. Problems are: Problem set: 24 solved, 802 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:45] [INFO ] Deduced a trap composed of 88 places in 222 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:45] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:48] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:58:50] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 39 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 4/43 constraints. Problems are: Problem set: 24 solved, 802 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/43 constraints. Problems are: Problem set: 24 solved, 802 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 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 TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 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 TDEAD83 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 TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 9 (OVERLAPS) 848/1184 variables, 336/379 constraints. Problems are: Problem set: 98 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1184/1184 variables, and 1107 constraints, problems are : Problem set: 98 solved, 728 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 728/826 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60318ms problems are : Problem set: 98 solved, 728 unsolved
Search for dead transitions found 98 dead transitions in 60321ms
Found 98 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 98 transitions
Dead transitions reduction (with SMT) removed 98 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 336/336 places, 750/848 transitions.
Applied a total of 0 rules in 8 ms. Remains 336 /336 variables (removed 0) and now considering 750/750 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:59:06] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61246 ms. Remains : 336/336 places, 750/848 transitions.
// Phase 1: matrix 750 rows 336 cols
[2025-05-30 03:59:07] [INFO ] Computed 34 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (19699 resets) in 1531 ms. (652 steps per ms)
BEST_FIRST walk for 1000000 steps (5870 resets) in 686 ms. (1455 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 03:59:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 03:59:09] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-30 03:59:09] [INFO ] [Real]Absence check using 9 positive and 25 generalized place invariants in 6 ms returned sat
[2025-05-30 03:59:09] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-05-30 03:59:09] [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 03:59:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-30 03:59:09] [INFO ] [Nat]Absence check using 9 positive and 25 generalized place invariants in 6 ms returned sat
[2025-05-30 03:59:09] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-30 03:59:09] [INFO ] Computed and/alt/rep : 184/870/184 causal constraints (skipped 544 transitions) in 33 ms.
[2025-05-30 03:59:10] [INFO ] Added : 39 causal constraints over 9 iterations in 494 ms. Result :sat
Minimization took 356 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:[1] Max Struct:[1]
Support contains 1 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 750/750 transitions.
Applied a total of 0 rules in 8 ms. Remains 336 /336 variables (removed 0) and now considering 750/750 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 336/336 places, 750/750 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 750/750 transitions.
Applied a total of 0 rules in 7 ms. Remains 336 /336 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2025-05-30 03:59:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:59:11] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-30 03:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:59:11] [INFO ] Implicit Places using invariants and state equation in 710 ms returned [15, 141, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257]
Discarding 16 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 928 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 320/336 places, 749/750 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 320 transition count 748
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 319 transition count 748
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 319 transition count 747
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 312 transition count 747
Applied a total of 16 rules in 21 ms. Remains 312 /320 variables (removed 8) and now considering 747/749 (removed 2) transitions.
// Phase 1: matrix 747 rows 312 cols
[2025-05-30 03:59:11] [INFO ] Computed 30 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:59:11] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-30 03:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:59:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 03:59:12] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 312/336 places, 747/750 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1936 ms. Remains : 312/336 places, 747/750 transitions.
[2025-05-30 03:59:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (19805 resets) in 1455 ms. (686 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 03:59:14] [INFO ] Flatten gal took : 117 ms
[2025-05-30 03:59:14] [INFO ] Flatten gal took : 68 ms
[2025-05-30 03:59:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9187038453132711440.gal : 27 ms
[2025-05-30 03:59:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6679777678909577643.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/ReachabilityCardinality9187038453132711440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6679777678909577643.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 ...328
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 234398 ms.

BK_STOP 1748577554758

--------------------
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-04a"
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-04a, 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-174853729100333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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