Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r015-oct2-177944372400040.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is ASLink-PT-03a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-oct2-177944372400040
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 357K Mar 3 18:30 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-03a-UpperBounds-00
FORMULA_NAME ASLink-PT-03a-UpperBounds-01
FORMULA_NAME ASLink-PT-03a-UpperBounds-02
FORMULA_NAME ASLink-PT-03a-UpperBounds-03
FORMULA_NAME ASLink-PT-03a-UpperBounds-04
FORMULA_NAME ASLink-PT-03a-UpperBounds-05
FORMULA_NAME ASLink-PT-03a-UpperBounds-06
FORMULA_NAME ASLink-PT-03a-UpperBounds-07
FORMULA_NAME ASLink-PT-03a-UpperBounds-08
FORMULA_NAME ASLink-PT-03a-UpperBounds-09
FORMULA_NAME ASLink-PT-03a-UpperBounds-10
FORMULA_NAME ASLink-PT-03a-UpperBounds-11
FORMULA_NAME ASLink-PT-03a-UpperBounds-12
FORMULA_NAME ASLink-PT-03a-UpperBounds-13
FORMULA_NAME ASLink-PT-03a-UpperBounds-14
FORMULA_NAME ASLink-PT-03a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779685499530

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 05:05:01] [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]
[2026-05-25 05:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:05:01] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2026-05-25 05:05:01] [INFO ] Transformed 821 places.
[2026-05-25 05:05:01] [INFO ] Transformed 1281 transitions.
[2026-05-25 05:05:01] [INFO ] Found NUPN structural information;
[2026-05-25 05:05:01] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1268 rows 821 cols
[2026-05-25 05:05:01] [INFO ] Computed 156 invariants in 72 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 (93 resets) in 104 ms. (95 steps per ms)
FORMULA ASLink-PT-03a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (114 resets) in 187 ms. (319 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-25 05:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:02] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2026-05-25 05:05:02] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 37 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2026-05-25 05:05:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 33 ms returned sat
[2026-05-25 05:05:04] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2026-05-25 05:05:04] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 119 ms.
[2026-05-25 05:05:08] [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 0
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:08] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 33 ms returned sat
[2026-05-25 05:05:09] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2026-05-25 05:05:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2026-05-25 05:05:09] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 49 ms returned sat
[2026-05-25 05:05:10] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2026-05-25 05:05:10] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 142 ms.
Maximisation of solution failed !
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:14] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2026-05-25 05:05:14] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 54 ms returned sat
[2026-05-25 05:05:15] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2026-05-25 05:05:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2026-05-25 05:05:15] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 33 ms returned sat
[2026-05-25 05:05:16] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2026-05-25 05:05:16] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 169 ms.
[2026-05-25 05:05:20] [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 2
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:20] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2026-05-25 05:05:20] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 80 ms returned sat
[2026-05-25 05:05:21] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2026-05-25 05:05:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2026-05-25 05:05:21] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 33 ms returned sat
[2026-05-25 05:05:22] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2026-05-25 05:05:22] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 162 ms.
[2026-05-25 05:05:26] [INFO ] Added : 180 causal constraints over 36 iterations in 3874 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:26] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2026-05-25 05:05:26] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 37 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2026-05-25 05:05:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 142 ms returned sat
[2026-05-25 05:05:28] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2026-05-25 05:05:28] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 145 ms.
[2026-05-25 05:05:32] [INFO ] Added : 155 causal constraints over 31 iterations in 3688 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:32] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2026-05-25 05:05:32] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 56 ms returned sat
[2026-05-25 05:05:33] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2026-05-25 05:05:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2026-05-25 05:05:33] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 66 ms returned sat
[2026-05-25 05:05:34] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2026-05-25 05:05:34] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 113 ms.
[2026-05-25 05:05:38] [INFO ] Added : 190 causal constraints over 38 iterations in 4038 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-03a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 803 transition count 1198
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 158 place count 733 transition count 1198
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 158 place count 733 transition count 1129
Deduced a syphon composed of 69 places in 2 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 323 place count 637 transition count 1129
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 637 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 325 place count 636 transition count 1128
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 330 place count 631 transition count 1100
Iterating global reduction 4 with 5 rules applied. Total rules applied 335 place count 631 transition count 1100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 339 place count 630 transition count 1097
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 341 place count 628 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 342 place count 627 transition count 1089
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 627 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 344 place count 626 transition count 1081
Iterating global reduction 6 with 1 rules applied. Total rules applied 345 place count 626 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 625 transition count 1073
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 625 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 624 transition count 1065
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 624 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 623 transition count 1057
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 623 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 622 transition count 1049
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 622 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 621 transition count 1041
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 621 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 620 transition count 1033
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 620 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 619 transition count 1025
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 619 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 618 transition count 1017
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 618 transition count 1017
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 617 transition count 1009
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 617 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 616 transition count 1001
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 616 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 615 transition count 993
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 615 transition count 993
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 614 transition count 985
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 614 transition count 985
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 613 transition count 977
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 613 transition count 977
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 612 transition count 969
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 612 transition count 969
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 415 place count 591 transition count 948
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 591 transition count 946
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 419 place count 589 transition count 946
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 423 place count 589 transition count 946
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 424 place count 588 transition count 945
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 430 place count 582 transition count 945
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 430 place count 582 transition count 933
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 25 rules applied. Total rules applied 455 place count 569 transition count 933
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 459 place count 565 transition count 933
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 459 place count 565 transition count 932
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 461 place count 564 transition count 932
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 469 place count 560 transition count 928
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 472 place count 557 transition count 925
Iterating global reduction 9 with 3 rules applied. Total rules applied 475 place count 557 transition count 925
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 478 place count 557 transition count 922
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 481 place count 554 transition count 922
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 484 place count 554 transition count 922
Applied a total of 484 rules in 839 ms. Remains 554 /821 variables (removed 267) and now considering 922/1268 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 848 ms. Remains : 554/821 places, 922/1268 transitions.
// Phase 1: matrix 922 rows 554 cols
[2026-05-25 05:05:42] [INFO ] Computed 99 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (13906 resets) in 2144 ms. (466 steps per ms)
BEST_FIRST walk for 3000002 steps (11632 resets) in 3070 ms. (976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-25 05:05:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:48] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2026-05-25 05:05:48] [INFO ] [Real]Absence check using 26 positive and 73 generalized place invariants in 19 ms returned sat
[2026-05-25 05:05:48] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2026-05-25 05:05:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:48] [INFO ] [Nat]Absence check using 26 positive place invariants in 22 ms returned sat
[2026-05-25 05:05:48] [INFO ] [Nat]Absence check using 26 positive and 73 generalized place invariants in 15 ms returned sat
[2026-05-25 05:05:49] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2026-05-25 05:05:49] [INFO ] Computed and/alt/rep : 354/1383/354 causal constraints (skipped 547 transitions) in 100 ms.
[2026-05-25 05:05:56] [INFO ] Added : 240 causal constraints over 48 iterations in 7736 ms. Result :sat
Minimization took 955 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:57] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2026-05-25 05:05:57] [INFO ] [Real]Absence check using 26 positive and 73 generalized place invariants in 14 ms returned sat
[2026-05-25 05:05:58] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2026-05-25 05:05:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:58] [INFO ] [Nat]Absence check using 26 positive place invariants in 21 ms returned sat
[2026-05-25 05:05:58] [INFO ] [Nat]Absence check using 26 positive and 73 generalized place invariants in 31 ms returned sat
[2026-05-25 05:05:58] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2026-05-25 05:05:58] [INFO ] Computed and/alt/rep : 354/1383/354 causal constraints (skipped 547 transitions) in 78 ms.
[2026-05-25 05:06:03] [INFO ] Added : 265 causal constraints over 53 iterations in 4910 ms. Result :sat
Minimization took 2280 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:06] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2026-05-25 05:06:06] [INFO ] [Real]Absence check using 26 positive and 73 generalized place invariants in 17 ms returned sat
[2026-05-25 05:06:06] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2026-05-25 05:06:06] [INFO ] Computed and/alt/rep : 354/1383/354 causal constraints (skipped 547 transitions) in 99 ms.
[2026-05-25 05:06:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:06] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2026-05-25 05:06:06] [INFO ] [Nat]Absence check using 26 positive and 73 generalized place invariants in 32 ms returned sat
[2026-05-25 05:06:07] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2026-05-25 05:06:07] [INFO ] Computed and/alt/rep : 354/1383/354 causal constraints (skipped 547 transitions) in 55 ms.
[2026-05-25 05:06:10] [INFO ] Added : 116 causal constraints over 24 iterations in 2666 ms. Result :sat
Minimization took 847 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:[1, 1, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 922/922 transitions.
Applied a total of 0 rules in 24 ms. Remains 554 /554 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 554/554 places, 922/922 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 922/922 transitions.
Applied a total of 0 rules in 23 ms. Remains 554 /554 variables (removed 0) and now considering 922/922 (removed 0) transitions.
[2026-05-25 05:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:13] [INFO ] Implicit Places using invariants in 791 ms returned [0, 18, 19, 20, 33, 51, 69, 138, 142, 151, 152, 153, 171, 189, 258, 262, 263, 274, 275, 276, 294, 312, 381, 385, 386, 389, 400, 401, 402, 420, 422, 425, 443, 444, 445, 446, 458, 464, 470, 476, 482, 488, 494, 500, 506, 512, 518]
[2026-05-25 05:06:13] [INFO ] Actually due to overlaps returned [420, 402, 33, 51, 153, 171, 276, 294, 425, 152, 275, 401, 444, 151, 274, 400, 422, 443, 0, 20, 262, 263, 385, 386, 18, 19, 69, 189, 312, 446, 488, 506, 518, 389, 445, 458, 464, 470, 476, 482, 494, 500, 512]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 798 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/554 places, 922/922 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 508 transition count 846
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 155 place count 432 transition count 846
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 155 place count 432 transition count 827
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 194 place count 412 transition count 827
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 206 place count 408 transition count 819
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 214 place count 400 transition count 819
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 229 place count 385 transition count 804
Iterating global reduction 4 with 15 rules applied. Total rules applied 244 place count 385 transition count 804
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 247 place count 385 transition count 801
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 247 place count 385 transition count 800
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 384 transition count 800
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 252 place count 381 transition count 797
Iterating global reduction 5 with 3 rules applied. Total rules applied 255 place count 381 transition count 797
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 380 transition count 796
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 380 transition count 796
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 258 place count 379 transition count 795
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 379 transition count 795
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 325 place count 346 transition count 762
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 328 place count 346 transition count 759
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 331 place count 343 transition count 756
Iterating global reduction 6 with 3 rules applied. Total rules applied 334 place count 343 transition count 756
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 337 place count 343 transition count 753
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 338 place count 343 transition count 752
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 345 place count 343 transition count 745
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 353 place count 335 transition count 745
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 363 place count 335 transition count 745
Applied a total of 363 rules in 190 ms. Remains 335 /511 variables (removed 176) and now considering 745/922 (removed 177) transitions.
// Phase 1: matrix 745 rows 335 cols
[2026-05-25 05:06:14] [INFO ] Computed 47 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:14] [INFO ] Implicit Places using invariants in 285 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 158, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272]
[2026-05-25 05:06:14] [INFO ] Actually due to overlaps returned [105, 191, 106, 192, 90, 96, 101, 102, 175, 181, 186, 261, 267, 272, 73, 158, 244]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 300 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 318/554 places, 745/922 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 306 transition count 733
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 306 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 303 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 303 transition count 730
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 42 place count 297 transition count 724
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 297 transition count 715
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 288 transition count 715
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 288 transition count 712
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 285 transition count 712
Applied a total of 66 rules in 65 ms. Remains 285 /318 variables (removed 33) and now considering 712/745 (removed 33) transitions.
// Phase 1: matrix 712 rows 285 cols
[2026-05-25 05:06:14] [INFO ] Computed 30 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:14] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-25 05:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:15] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 285/554 places, 712/922 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2601 ms. Remains : 285/554 places, 712/922 transitions.
[2026-05-25 05:06:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-03a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (21209 resets) in 1596 ms. (626 steps per ms)
BEST_FIRST walk for 1000001 steps (7318 resets) in 778 ms. (1283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:18] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-25 05:06:18] [INFO ] [Real]Absence check using 10 positive and 20 generalized place invariants in 7 ms returned sat
[2026-05-25 05:06:18] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2026-05-25 05:06:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-25 05:06:18] [INFO ] [Nat]Absence check using 10 positive and 20 generalized place invariants in 8 ms returned sat
[2026-05-25 05:06:18] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2026-05-25 05:06:18] [INFO ] Computed and/alt/rep : 134/683/134 causal constraints (skipped 560 transitions) in 66 ms.
[2026-05-25 05:06:19] [INFO ] Added : 60 causal constraints over 13 iterations in 960 ms. Result :sat
Minimization took 329 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 285 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p23) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 711/711 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 284 transition count 710
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 283 transition count 708
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 282 transition count 707
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 281 transition count 706
Applied a total of 4 rules in 17 ms. Remains 281 /285 variables (removed 4) and now considering 706/711 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 281/285 places, 706/711 transitions.
// Phase 1: matrix 706 rows 281 cols
[2026-05-25 05:06:20] [INFO ] Computed 30 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21212 resets) in 1751 ms. (570 steps per ms)
BEST_FIRST walk for 1000001 steps (7315 resets) in 776 ms. (1287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:22] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 05:06:22] [INFO ] [Real]Absence check using 9 positive and 21 generalized place invariants in 11 ms returned sat
[2026-05-25 05:06:23] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2026-05-25 05:06:23] [INFO ] Computed and/alt/rep : 128/659/128 causal constraints (skipped 560 transitions) in 57 ms.
[2026-05-25 05:06:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 05:06:23] [INFO ] [Nat]Absence check using 9 positive and 21 generalized place invariants in 15 ms returned sat
[2026-05-25 05:06:23] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2026-05-25 05:06:23] [INFO ] Computed and/alt/rep : 128/659/128 causal constraints (skipped 560 transitions) in 60 ms.
[2026-05-25 05:06:24] [INFO ] Added : 8 causal constraints over 2 iterations in 213 ms. Result :sat
Minimization took 314 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 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 706/706 transitions.
Applied a total of 0 rules in 11 ms. Remains 281 /281 variables (removed 0) and now considering 706/706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 281/281 places, 706/706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 706/706 transitions.
Applied a total of 0 rules in 10 ms. Remains 281 /281 variables (removed 0) and now considering 706/706 (removed 0) transitions.
[2026-05-25 05:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:24] [INFO ] Implicit Places using invariants in 272 ms returned [17, 84]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 274 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 279/281 places, 706/706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 279 transition count 699
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 272 transition count 699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 270 transition count 697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 270 transition count 695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 268 transition count 695
Applied a total of 22 rules in 32 ms. Remains 268 /279 variables (removed 11) and now considering 695/706 (removed 11) transitions.
// Phase 1: matrix 695 rows 268 cols
[2026-05-25 05:06:24] [INFO ] Computed 28 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:25] [INFO ] Implicit Places using invariants in 457 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 267/281 places, 695/706 transitions.
Applied a total of 0 rules in 9 ms. Remains 267 /267 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 799 ms. Remains : 267/281 places, 695/706 transitions.
// Phase 1: matrix 695 rows 267 cols
[2026-05-25 05:06:25] [INFO ] Computed 27 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21712 resets) in 1624 ms. (615 steps per ms)
BEST_FIRST walk for 1000000 steps (7565 resets) in 728 ms. (1371 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:06:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:27] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-25 05:06:27] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 8 ms returned sat
[2026-05-25 05:06:28] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2026-05-25 05:06:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-25 05:06:28] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 19 ms returned sat
[2026-05-25 05:06:28] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2026-05-25 05:06:28] [INFO ] Computed and/alt/rep : 117/650/117 causal constraints (skipped 560 transitions) in 41 ms.
[2026-05-25 05:06:28] [INFO ] Added : 8 causal constraints over 2 iterations in 215 ms. Result :sat
Minimization took 282 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 695/695 transitions.
Applied a total of 0 rules in 10 ms. Remains 267 /267 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 267/267 places, 695/695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 695/695 transitions.
Applied a total of 0 rules in 9 ms. Remains 267 /267 variables (removed 0) and now considering 695/695 (removed 0) transitions.
[2026-05-25 05:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:29] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-25 05:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:30] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:06:30] [INFO ] Redundant transitions in 44 ms returned []
Running 677 sub problems to find dead transitions.
[2026-05-25 05:06:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 3 (OVERLAPS) 2/267 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:52] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 19 ms to minimize.
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:53] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 12 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD225 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:58] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/962 variables, and 30 constraints, problems are : Problem set: 13 solved, 664 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 677/677 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 664 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 5/5 constraints. Problems are: Problem set: 13 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 14/19 constraints. Problems are: Problem set: 13 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/19 constraints. Problems are: Problem set: 13 solved, 664 unsolved
At refinement iteration 3 (OVERLAPS) 2/267 variables, 5/24 constraints. Problems are: Problem set: 13 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/27 constraints. Problems are: Problem set: 13 solved, 664 unsolved
Problem TDEAD627 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 3/30 constraints. Problems are: Problem set: 14 solved, 663 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:14] [INFO ] Deduced a trap composed of 70 places in 235 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 1/31 constraints. Problems are: Problem set: 14 solved, 663 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/31 constraints. Problems are: Problem set: 14 solved, 663 unsolved
Problem TDEAD3 is UNSAT
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 TDEAD27 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 TDEAD35 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 TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 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 TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 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 TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 8 (OVERLAPS) 695/962 variables, 267/298 constraints. Problems are: Problem set: 128 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/962 variables, and 847 constraints, problems are : Problem set: 128 solved, 549 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 549/677 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 128 solved, 549 unsolved
Search for dead transitions found 128 dead transitions in 60434ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 267/267 places, 567/695 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 266 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 266 transition count 566
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 265 transition count 566
Applied a total of 3 rules in 12 ms. Remains 265 /267 variables (removed 2) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 265 cols
[2026-05-25 05:07:30] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:30] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-25 05:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 05:07:31] [INFO ] Implicit Places using invariants and state equation in 697 ms returned [70, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186]
Discarding 15 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1039 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 250/267 places, 565/695 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 250 transition count 564
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 249 transition count 564
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 249 transition count 563
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 242 transition count 563
Applied a total of 16 rules in 27 ms. Remains 242 /250 variables (removed 8) and now considering 563/565 (removed 2) transitions.
// Phase 1: matrix 563 rows 242 cols
[2026-05-25 05:07:31] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:32] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-25 05:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 05:07:32] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 242/267 places, 563/695 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63738 ms. Remains : 242/267 places, 563/695 transitions.
[2026-05-25 05:07:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-03a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (21863 resets) in 1418 ms. (704 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 05:07:34] [INFO ] Flatten gal took : 147 ms
[2026-05-25 05:07:34] [INFO ] Flatten gal took : 64 ms
[2026-05-25 05:07:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11726825527395558145.gal : 32 ms
[2026-05-25 05:07:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3061097535427217877.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/ReachabilityCardinality11726825527395558145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3061097535427217877.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 153850 ms.

BK_STOP 1779685655136

--------------------
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-03a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ASLink-PT-03a, 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 r015-oct2-177944372400040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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