Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K 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 36K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 417K 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-02b-UpperBounds-00
FORMULA_NAME ASLink-PT-02b-UpperBounds-01
FORMULA_NAME ASLink-PT-02b-UpperBounds-02
FORMULA_NAME ASLink-PT-02b-UpperBounds-03
FORMULA_NAME ASLink-PT-02b-UpperBounds-04
FORMULA_NAME ASLink-PT-02b-UpperBounds-05
FORMULA_NAME ASLink-PT-02b-UpperBounds-06
FORMULA_NAME ASLink-PT-02b-UpperBounds-07
FORMULA_NAME ASLink-PT-02b-UpperBounds-08
FORMULA_NAME ASLink-PT-02b-UpperBounds-09
FORMULA_NAME ASLink-PT-02b-UpperBounds-10
FORMULA_NAME ASLink-PT-02b-UpperBounds-11
FORMULA_NAME ASLink-PT-02b-UpperBounds-12
FORMULA_NAME ASLink-PT-02b-UpperBounds-13
FORMULA_NAME ASLink-PT-02b-UpperBounds-14
FORMULA_NAME ASLink-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748569715579

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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 01:48:37] [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 01:48:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:48:37] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2025-05-30 01:48:37] [INFO ] Transformed 1242 places.
[2025-05-30 01:48:37] [INFO ] Transformed 1621 transitions.
[2025-05-30 01:48:37] [INFO ] Found NUPN structural information;
[2025-05-30 01:48:37] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
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 1621 rows 1242 cols
[2025-05-30 01:48:37] [INFO ] Computed 121 invariants in 93 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 (43 resets) in 60 ms. (163 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (35 resets) in 49 ms. (800 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 01:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 01:48:38] [INFO ] [Real]Absence check using 27 positive place invariants in 39 ms returned sat
[2025-05-30 01:48:38] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 70 ms returned sat
[2025-05-30 01:48:39] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2025-05-30 01:48: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 01:48:47] [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.verifyPossible(DeadlockTester.java:829)
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 01:48:47] [INFO ] [Real]Absence check using 27 positive place invariants in 26 ms returned sat
[2025-05-30 01:48:47] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 71 ms returned sat
[2025-05-30 01:48:47] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2025-05-30 01:48:48] [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 01:48:49] [INFO ] [Nat]Absence check using 27 positive place invariants in 29 ms returned sat
[2025-05-30 01:48:49] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 66 ms returned sat
[2025-05-30 01:48:50] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2025-05-30 01:48:50] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 82 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:53] [INFO ] Deduced a trap composed of 12 places in 470 ms of which 52 ms to minimize.
[2025-05-30 01:48:53] [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: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
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 01:48:53] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2025-05-30 01:48:53] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 75 ms returned sat
[2025-05-30 01:48:54] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2025-05-30 01:48:54] [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 01:48:54] [INFO ] [Nat]Absence check using 27 positive place invariants in 25 ms returned sat
[2025-05-30 01:48:54] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 72 ms returned sat
[2025-05-30 01:48:55] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:56] [INFO ] Deduced a trap composed of 15 places in 423 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:56] [INFO ] Deduced a trap composed of 108 places in 510 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:57] [INFO ] Deduced a trap composed of 22 places in 398 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:48:57] [INFO ] Deduced a trap composed of 279 places in 690 ms of which 324 ms to minimize.
[2025-05-30 01:48:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2332 ms
[2025-05-30 01:48:58] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 78 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 01:48:59] [INFO ] [Real]Absence check using 27 positive place invariants in 23 ms returned sat
[2025-05-30 01:48:59] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 63 ms returned sat
[2025-05-30 01:49:00] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2025-05-30 01:49: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 01:49:00] [INFO ] [Nat]Absence check using 27 positive place invariants in 25 ms returned sat
[2025-05-30 01:49:00] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 63 ms returned sat
[2025-05-30 01:49:01] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2025-05-30 01:49:01] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 78 ms.
[2025-05-30 01:49:05] [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 3
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)
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 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1242 transition count 1342
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 293 rules applied. Total rules applied 572 place count 963 transition count 1328
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 577 place count 959 transition count 1327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 578 place count 958 transition count 1327
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 283 Pre rules applied. Total rules applied 578 place count 958 transition count 1044
Deduced a syphon composed of 283 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 589 rules applied. Total rules applied 1167 place count 652 transition count 1044
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 20 rules applied. Total rules applied 1187 place count 649 transition count 1027
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1204 place count 632 transition count 1027
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1204 place count 632 transition count 1019
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1228 place count 616 transition count 1019
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1228 place count 616 transition count 1011
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1244 place count 608 transition count 1011
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1282 place count 570 transition count 973
Iterating global reduction 6 with 38 rules applied. Total rules applied 1320 place count 570 transition count 973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1321 place count 570 transition count 972
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1321 place count 570 transition count 958
Deduced a syphon composed of 14 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 29 rules applied. Total rules applied 1350 place count 555 transition count 958
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1350 place count 555 transition count 957
Deduced a syphon composed of 1 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1353 place count 553 transition count 957
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1356 place count 550 transition count 936
Iterating global reduction 7 with 3 rules applied. Total rules applied 1359 place count 550 transition count 936
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1359 place count 550 transition count 934
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1363 place count 548 transition count 934
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1364 place count 547 transition count 926
Iterating global reduction 7 with 1 rules applied. Total rules applied 1365 place count 547 transition count 926
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1366 place count 546 transition count 918
Iterating global reduction 7 with 1 rules applied. Total rules applied 1367 place count 546 transition count 918
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1368 place count 545 transition count 910
Iterating global reduction 7 with 1 rules applied. Total rules applied 1369 place count 545 transition count 910
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1370 place count 544 transition count 902
Iterating global reduction 7 with 1 rules applied. Total rules applied 1371 place count 544 transition count 902
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1372 place count 543 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 1373 place count 543 transition count 894
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1374 place count 542 transition count 886
Iterating global reduction 7 with 1 rules applied. Total rules applied 1375 place count 542 transition count 886
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 541 transition count 878
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 541 transition count 878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 540 transition count 870
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 540 transition count 870
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 539 transition count 862
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 539 transition count 862
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 538 transition count 854
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 538 transition count 854
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 537 transition count 846
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 537 transition count 846
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 536 transition count 838
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 536 transition count 838
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 535 transition count 830
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 535 transition count 830
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1390 place count 534 transition count 822
Iterating global reduction 7 with 1 rules applied. Total rules applied 1391 place count 534 transition count 822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1392 place count 533 transition count 814
Iterating global reduction 7 with 1 rules applied. Total rules applied 1393 place count 533 transition count 814
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1394 place count 532 transition count 806
Iterating global reduction 7 with 1 rules applied. Total rules applied 1395 place count 532 transition count 806
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 1525 place count 467 transition count 741
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1526 place count 466 transition count 740
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1528 place count 465 transition count 740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1529 place count 464 transition count 739
Iterating global reduction 7 with 1 rules applied. Total rules applied 1530 place count 464 transition count 739
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 7 with 2 rules applied. Total rules applied 1532 place count 464 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1533 place count 463 transition count 737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 1535 place count 462 transition count 746
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1538 place count 462 transition count 743
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1541 place count 459 transition count 743
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1542 place count 459 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1543 place count 458 transition count 742
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1544 place count 457 transition count 741
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1550 place count 453 transition count 739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1552 place count 451 transition count 739
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1552 place count 451 transition count 733
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 1564 place count 445 transition count 733
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1567 place count 442 transition count 733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1567 place count 442 transition count 732
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1569 place count 441 transition count 732
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1577 place count 437 transition count 728
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1579 place count 435 transition count 726
Iterating global reduction 14 with 2 rules applied. Total rules applied 1581 place count 435 transition count 726
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1583 place count 435 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1585 place count 433 transition count 724
Applied a total of 1585 rules in 770 ms. Remains 433 /1242 variables (removed 809) and now considering 724/1621 (removed 897) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 433/1242 places, 724/1621 transitions.
// Phase 1: matrix 724 rows 433 cols
[2025-05-30 01:49:06] [INFO ] Computed 77 invariants in 26 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 (16347 resets) in 1655 ms. (603 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (16740 resets) in 2227 ms. (1346 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 01:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:10] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-30 01:49:10] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-30 01:49:10] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-05-30 01:49: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 01:49:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-30 01:49:10] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-30 01:49:10] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-05-30 01:49:10] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 45 ms.
[2025-05-30 01:49:12] [INFO ] Added : 172 causal constraints over 35 iterations in 1943 ms. Result :sat
Minimization took 423 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:13] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-30 01:49:13] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-30 01:49:13] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-05-30 01:49:13] [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 01:49:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-30 01:49:13] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 13 ms returned sat
[2025-05-30 01:49:13] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-05-30 01:49:13] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 33 ms.
[2025-05-30 01:49:15] [INFO ] Added : 215 causal constraints over 43 iterations in 1914 ms. Result :sat
Minimization took 365 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:16] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-30 01:49:16] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-30 01:49:16] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2025-05-30 01:49:16] [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 01:49:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-30 01:49:16] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-30 01:49:16] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-05-30 01:49:16] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 34 ms.
[2025-05-30 01:49:17] [INFO ] Added : 52 causal constraints over 11 iterations in 864 ms. Result :sat
Minimization took 430 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 724/724 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 433/433 places, 724/724 transitions.
[2025-05-30 01:49:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (16177 resets) in 1559 ms. (641 steps per ms)
BEST_FIRST walk for 3000002 steps (16559 resets) in 2358 ms. (1271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 01:49:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:22] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-30 01:49:22] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-30 01:49:22] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-05-30 01:49:22] [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 01:49:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-30 01:49:23] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-30 01:49:23] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-05-30 01:49:23] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 45 ms.
[2025-05-30 01:49:25] [INFO ] Added : 172 causal constraints over 35 iterations in 1876 ms. Result :sat
Minimization took 426 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:25] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-30 01:49:25] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-30 01:49:25] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-30 01:49:25] [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 01:49:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-30 01:49:25] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-30 01:49:26] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-05-30 01:49:26] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 39 ms.
[2025-05-30 01:49:28] [INFO ] Added : 215 causal constraints over 43 iterations in 1959 ms. Result :sat
Minimization took 385 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:28] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-30 01:49:28] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 18 ms returned sat
[2025-05-30 01:49:28] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-05-30 01:49:28] [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 01:49:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-30 01:49:28] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-30 01:49:29] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-05-30 01:49:29] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 36 ms.
[2025-05-30 01:49:29] [INFO ] Added : 52 causal constraints over 11 iterations in 845 ms. Result :sat
Minimization took 421 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 724/724 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 433/433 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 724/724 transitions.
Applied a total of 0 rules in 29 ms. Remains 433 /433 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2025-05-30 01:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:31] [INFO ] Implicit Places using invariants in 475 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 152, 153, 155, 172, 190, 259, 263, 264, 267, 278, 279, 280, 298, 300, 304, 322, 323, 324, 325, 337, 343, 349, 355, 361, 367, 373, 379, 385, 391, 397]
[2025-05-30 01:49:31] [INFO ] Actually due to overlaps returned [298, 280, 48, 172, 304, 31, 155, 152, 278, 322, 153, 279, 300, 323, 1, 18, 263, 264, 66, 190, 324, 367, 385, 397, 19, 267, 325, 337, 343, 349, 355, 361, 373, 379, 391]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 492 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 398/433 places, 724/724 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 396 transition count 661
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 333 transition count 658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 332 transition count 658
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 132 place count 332 transition count 643
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 163 place count 316 transition count 643
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 175 place count 312 transition count 635
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 183 place count 304 transition count 635
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 198 place count 289 transition count 620
Iterating global reduction 5 with 15 rules applied. Total rules applied 213 place count 289 transition count 620
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 289 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 216 place count 289 transition count 616
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 288 transition count 616
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 221 place count 285 transition count 610
Iterating global reduction 6 with 3 rules applied. Total rules applied 224 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 225 place count 284 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 284 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 227 place count 283 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 283 transition count 607
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 270 place count 262 transition count 586
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 272 place count 260 transition count 584
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 place count 260 transition count 584
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 276 place count 260 transition count 582
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 280 place count 258 transition count 583
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 284 place count 258 transition count 579
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 289 place count 253 transition count 579
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 295 place count 253 transition count 579
Applied a total of 295 rules in 98 ms. Remains 253 /398 variables (removed 145) and now considering 579/724 (removed 145) transitions.
// Phase 1: matrix 579 rows 253 cols
[2025-05-30 01:49:31] [INFO ] Computed 34 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:31] [INFO ] Implicit Places using invariants in 203 ms returned [72, 91, 97, 100, 102, 103, 108, 109, 161, 178, 184, 187, 189]
[2025-05-30 01:49:31] [INFO ] Actually due to overlaps returned [108, 109, 91, 97, 102, 178, 184, 189, 72, 103, 161]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 205 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 242/433 places, 579/724 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 234 transition count 571
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 234 transition count 571
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 232 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 232 transition count 569
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 228 transition count 565
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 228 transition count 559
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 222 transition count 559
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 222 transition count 557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 220 transition count 557
Applied a total of 44 rules in 101 ms. Remains 220 /242 variables (removed 22) and now considering 557/579 (removed 22) transitions.
// Phase 1: matrix 557 rows 220 cols
[2025-05-30 01:49:32] [INFO ] Computed 23 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:32] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 01:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:32] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 220/433 places, 557/724 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1501 ms. Remains : 220/433 places, 557/724 transitions.
[2025-05-30 01:49:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (25225 resets) in 1323 ms. (755 steps per ms)
BEST_FIRST walk for 3000002 steps (28993 resets) in 1961 ms. (1529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 01:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-30 01:49:35] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-30 01:49:36] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-30 01:49:36] [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 01:49:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-30 01:49:36] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-30 01:49:36] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-30 01:49:36] [INFO ] Computed and/alt/rep : 99/569/99 causal constraints (skipped 441 transitions) in 30 ms.
[2025-05-30 01:49:36] [INFO ] Added : 14 causal constraints over 3 iterations in 153 ms. Result :sat
Minimization took 202 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-30 01:49:36] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-30 01:49:36] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-05-30 01:49:36] [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 01:49:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-30 01:49:36] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-30 01:49:37] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-30 01:49:37] [INFO ] Computed and/alt/rep : 99/569/99 causal constraints (skipped 441 transitions) in 30 ms.
[2025-05-30 01:49:37] [INFO ] Added : 13 causal constraints over 3 iterations in 163 ms. Result :sat
Minimization took 334 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:49:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-30 01:49:37] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 11 ms returned sat
[2025-05-30 01:49:37] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-30 01:49:37] [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 01:49:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-30 01:49:37] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 9 ms returned sat
[2025-05-30 01:49:37] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-30 01:49:37] [INFO ] Computed and/alt/rep : 99/569/99 causal constraints (skipped 441 transitions) in 29 ms.
[2025-05-30 01:49:38] [INFO ] Added : 44 causal constraints over 10 iterations in 454 ms. Result :sat
Minimization took 223 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 557/557 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 220/220 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 557/557 transitions.
Applied a total of 0 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2025-05-30 01:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-05-30 01:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:49:39] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:49:39] [INFO ] Redundant transitions in 29 ms returned []
Running 540 sub problems to find dead transitions.
[2025-05-30 01:49:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (OVERLAPS) 1/220 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:49:50] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:49:51] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:49:52] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:49:52] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:49:53] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 7 (OVERLAPS) 557/777 variables, 220/248 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/777 variables, and 248 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (OVERLAPS) 1/220 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 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 TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 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 TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 7 (OVERLAPS) 557/777 variables, 220/248 constraints. Problems are: Problem set: 130 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 658 constraints, problems are : Problem set: 130 solved, 410 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 410/540 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 130 solved, 410 unsolved
Search for dead transitions found 130 dead transitions in 60336ms
Found 130 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 130 transitions
Dead transitions reduction (with SMT) removed 130 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/220 places, 427/557 transitions.
Applied a total of 0 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:50:39] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61021 ms. Remains : 220/220 places, 427/557 transitions.
// Phase 1: matrix 427 rows 220 cols
[2025-05-30 01:50:39] [INFO ] Computed 23 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (25324 resets) in 1149 ms. (869 steps per ms)
BEST_FIRST walk for 3000002 steps (28946 resets) in 1683 ms. (1781 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 01:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:50:42] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:42] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 4 ms returned sat
[2025-05-30 01:50:42] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-30 01:50:42] [INFO ] Computed and/alt/rep : 254/1176/254 causal constraints (skipped 156 transitions) in 21 ms.
[2025-05-30 01:50:42] [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 01:50:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-30 01:50:42] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 4 ms returned sat
[2025-05-30 01:50:43] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-30 01:50:43] [INFO ] Computed and/alt/rep : 254/1176/254 causal constraints (skipped 156 transitions) in 22 ms.
[2025-05-30 01:50:43] [INFO ] Added : 91 causal constraints over 19 iterations in 507 ms. Result :sat
Minimization took 375 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:50:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-30 01:50:43] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 3 ms returned sat
[2025-05-30 01:50:44] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-05-30 01:50:44] [INFO ] Computed and/alt/rep : 254/1176/254 causal constraints (skipped 156 transitions) in 21 ms.
[2025-05-30 01:50:44] [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 01:50:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:44] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 4 ms returned sat
[2025-05-30 01:50:44] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-05-30 01:50:44] [INFO ] Computed and/alt/rep : 254/1176/254 causal constraints (skipped 156 transitions) in 23 ms.
[2025-05-30 01:50:44] [INFO ] Added : 90 causal constraints over 19 iterations in 492 ms. Result :sat
Minimization took 429 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:50:45] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:45] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 5 ms returned sat
[2025-05-30 01:50:45] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-30 01:50:45] [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 01:50:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-30 01:50:45] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 4 ms returned sat
[2025-05-30 01:50:45] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-05-30 01:50:45] [INFO ] Computed and/alt/rep : 254/1176/254 causal constraints (skipped 156 transitions) in 21 ms.
[2025-05-30 01:50:46] [INFO ] Added : 177 causal constraints over 36 iterations in 1196 ms. Result :sat
Minimization took 521 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 427/427 transitions.
Applied a total of 0 rules in 5 ms. Remains 220 /220 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 220/220 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 427/427 transitions.
Applied a total of 0 rules in 4 ms. Remains 220 /220 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2025-05-30 01:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:50:47] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-30 01:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:50:48] [INFO ] Implicit Places using invariants and state equation in 406 ms returned [95, 99, 101, 103, 105]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 562 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/220 places, 427/427 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 211 transition count 395
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 211 transition count 395
Applied a total of 8 rules in 8 ms. Remains 211 /215 variables (removed 4) and now considering 395/427 (removed 32) transitions.
// Phase 1: matrix 395 rows 211 cols
[2025-05-30 01:50:48] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:50:48] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-05-30 01:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:50:48] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/220 places, 395/427 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1128 ms. Remains : 211/220 places, 395/427 transitions.
[2025-05-30 01:50:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (25310 resets) in 1103 ms. (905 steps per ms)
BEST_FIRST walk for 3000002 steps (28974 resets) in 1677 ms. (1787 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 01:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:50:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:51] [INFO ] [Real]Absence check using 8 positive and 14 generalized place invariants in 4 ms returned sat
[2025-05-30 01:50:51] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-05-30 01:50:51] [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 01:50:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:51] [INFO ] [Nat]Absence check using 8 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-30 01:50:51] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-30 01:50:51] [INFO ] Computed and/alt/rep : 221/1005/221 causal constraints (skipped 157 transitions) in 22 ms.
[2025-05-30 01:50:52] [INFO ] Added : 78 causal constraints over 16 iterations in 446 ms. Result :sat
Minimization took 264 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:50:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:52] [INFO ] [Real]Absence check using 8 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-30 01:50:52] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-30 01:50:52] [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 01:50:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:52] [INFO ] [Nat]Absence check using 8 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-30 01:50:52] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-30 01:50:52] [INFO ] Computed and/alt/rep : 221/1005/221 causal constraints (skipped 157 transitions) in 22 ms.
[2025-05-30 01:50:53] [INFO ] Added : 72 causal constraints over 16 iterations in 415 ms. Result :sat
Minimization took 235 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:50:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:53] [INFO ] [Real]Absence check using 8 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-30 01:50:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-05-30 01:50: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 01:50:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-30 01:50:53] [INFO ] [Nat]Absence check using 8 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-30 01:50:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-30 01:50:53] [INFO ] Computed and/alt/rep : 221/1005/221 causal constraints (skipped 157 transitions) in 17 ms.
[2025-05-30 01:50:54] [INFO ] Added : 139 causal constraints over 29 iterations in 966 ms. Result :sat
Minimization took 331 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 395/395 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 395/395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 395/395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 395/395 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2025-05-30 01:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:50:55] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-05-30 01:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:50:55] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:50:55] [INFO ] Redundant transitions in 25 ms returned []
Running 378 sub problems to find dead transitions.
[2025-05-30 01:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:57] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:57] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:57] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:57] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 9 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:57] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 10 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:57] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 9 ms to minimize.
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 10 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 9 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 10 ms to minimize.
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 10 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 7 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 13 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 15 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 12 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 11 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:59] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 10 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:59] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 9 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:59] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 13 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:00] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 12 ms to minimize.
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:00] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 8 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 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 TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 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 TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/39 constraints. Problems are: Problem set: 96 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Problem TDEAD380 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:01] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:01] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 10 ms to minimize.
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 4/43 constraints. Problems are: Problem set: 108 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/43 constraints. Problems are: Problem set: 108 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 1/211 variables, 3/46 constraints. Problems are: Problem set: 108 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:05] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:05] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:05] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 5 ms to minimize.
Problem TDEAD181 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:05] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:05] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 6 ms to minimize.
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 5/51 constraints. Problems are: Problem set: 124 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/51 constraints. Problems are: Problem set: 124 solved, 254 unsolved
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 8 (OVERLAPS) 395/606 variables, 211/262 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/262 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 0/606 variables, 0/262 constraints. Problems are: Problem set: 140 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 262 constraints, problems are : Problem set: 140 solved, 238 unsolved in 24300 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 140 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 5/5 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 14/19 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 24/43 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/43 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 1/211 variables, 3/46 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 5/51 constraints. Problems are: Problem set: 140 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/51 constraints. Problems are: Problem set: 140 solved, 238 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 7 (OVERLAPS) 395/606 variables, 211/262 constraints. Problems are: Problem set: 172 solved, 206 unsolved
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 206/468 constraints. Problems are: Problem set: 174 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 1/469 constraints. Problems are: Problem set: 174 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 469 constraints, problems are : Problem set: 174 solved, 204 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 206/378 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54404ms problems are : Problem set: 174 solved, 204 unsolved
Search for dead transitions found 174 dead transitions in 54405ms
Found 174 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 174 transitions
Dead transitions reduction (with SMT) removed 174 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/211 places, 221/395 transitions.
Ensure Unique test removed 35 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 176 transition count 181
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 115 place count 136 transition count 181
Applied a total of 115 rules in 5 ms. Remains 136 /211 variables (removed 75) and now considering 181/221 (removed 40) transitions.
// Phase 1: matrix 181 rows 136 cols
[2025-05-30 01:51:50] [INFO ] Computed 21 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:50] [INFO ] Implicit Places using invariants in 116 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 135/211 places, 181/395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 135 transition count 176
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 130 transition count 176
Applied a total of 10 rules in 4 ms. Remains 130 /135 variables (removed 5) and now considering 176/181 (removed 5) transitions.
// Phase 1: matrix 176 rows 130 cols
[2025-05-30 01:51:50] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-30 01:51:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:50] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 130/211 places, 176/395 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55313 ms. Remains : 130/211 places, 176/395 transitions.
[2025-05-30 01:51:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (33125 resets) in 1050 ms. (951 steps per ms)
BEST_FIRST walk for 3000002 steps (31827 resets) in 1475 ms. (2032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 01:51:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:51:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-30 01:51:53] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-30 01:51: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 01:51:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-30 01:51:53] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 9 ms.
[2025-05-30 01:51:53] [INFO ] Added : 15 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-30 01:51:53] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-30 01:51: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 01:51:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-05-30 01:51:53] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 7 ms.
[2025-05-30 01:51:53] [INFO ] Added : 16 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-30 01:51:53] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-30 01:51: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 01:51:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-30 01:51:53] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-30 01:51:53] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 7 ms.
[2025-05-30 01:51:53] [INFO ] Added : 36 causal constraints over 8 iterations in 130 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 130 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p413) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 175/175 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 128 transition count 173
Applied a total of 4 rules in 4 ms. Remains 128 /130 variables (removed 2) and now considering 173/175 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/130 places, 173/175 transitions.
// Phase 1: matrix 173 rows 128 cols
[2025-05-30 01:51:54] [INFO ] Computed 20 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33180 resets) in 1032 ms. (968 steps per ms)
BEST_FIRST walk for 1000000 steps (10648 resets) in 475 ms. (2100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 01:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-30 01:51:55] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-30 01:51:55] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-30 01:51:55] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-30 01:51: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 01:51:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-30 01:51:55] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-30 01:51:55] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-05-30 01:51:55] [INFO ] Computed and/alt/rep : 76/247/76 causal constraints (skipped 80 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:55] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2025-05-30 01:51:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-05-30 01:51:55] [INFO ] Added : 29 causal constraints over 6 iterations in 163 ms. Result :sat
Minimization took 66 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 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 173/173 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 128/128 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 173/173 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2025-05-30 01:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-30 01:51:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:56] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:51:56] [INFO ] Redundant transitions in 1 ms returned []
Running 156 sub problems to find dead transitions.
[2025-05-30 01:51:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:57] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:58] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 173/301 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 151 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6117 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 173/301 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 156/307 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 307 constraints, problems are : Problem set: 0 solved, 156 unsolved in 12339 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18480ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 18481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18695 ms. Remains : 128/128 places, 173/173 transitions.
RANDOM walk for 40000 steps (1352 resets) in 619 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (409 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (435 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21850 steps, run visited all 2 properties in 191 ms. (steps per millisecond=114 )
Probabilistic random walk after 21850 steps, saw 15496 distinct states, run finished after 199 ms. (steps per millisecond=109 ) properties seen :2
[2025-05-30 01:52:15] [INFO ] Flatten gal took : 67 ms
[2025-05-30 01:52:15] [INFO ] Flatten gal took : 18 ms
[2025-05-30 01:52:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9202983178523754263.gal : 11 ms
[2025-05-30 01:52:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2030522256882148956.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/ReachabilityCardinality9202983178523754263.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2030522256882148956.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.
FORMULA ASLink-PT-02b-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 217902 ms.

BK_STOP 1748569935467

--------------------
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-02b"
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-02b, 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-174853729000309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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