Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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.8K 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 839K 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-09a-UpperBounds-00
FORMULA_NAME ASLink-PT-09a-UpperBounds-01
FORMULA_NAME ASLink-PT-09a-UpperBounds-02
FORMULA_NAME ASLink-PT-09a-UpperBounds-03
FORMULA_NAME ASLink-PT-09a-UpperBounds-04
FORMULA_NAME ASLink-PT-09a-UpperBounds-05
FORMULA_NAME ASLink-PT-09a-UpperBounds-06
FORMULA_NAME ASLink-PT-09a-UpperBounds-07
FORMULA_NAME ASLink-PT-09a-UpperBounds-08
FORMULA_NAME ASLink-PT-09a-UpperBounds-09
FORMULA_NAME ASLink-PT-09a-UpperBounds-10
FORMULA_NAME ASLink-PT-09a-UpperBounds-11
FORMULA_NAME ASLink-PT-09a-UpperBounds-12
FORMULA_NAME ASLink-PT-09a-UpperBounds-13
FORMULA_NAME ASLink-PT-09a-UpperBounds-14
FORMULA_NAME ASLink-PT-09a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540616231

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:43: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-29 17:43:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:43:37] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2025-05-29 17:43:37] [INFO ] Transformed 1991 places.
[2025-05-29 17:43:37] [INFO ] Transformed 2919 transitions.
[2025-05-29 17:43:37] [INFO ] Found NUPN structural information;
[2025-05-29 17:43:37] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 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 2888 rows 1991 cols
[2025-05-29 17:43:38] [INFO ] Computed 384 invariants in 197 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 (40 resets) in 92 ms. (107 steps per ms)
FORMULA ASLink-PT-09a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (40 resets) in 257 ms. (426 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:43:38] [INFO ] Invariant cache hit.
[2025-05-29 17:43:39] [INFO ] [Real]Absence check using 93 positive place invariants in 157 ms returned sat
[2025-05-29 17:43:39] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 79 ms returned sat
[2025-05-29 17:43:40] [INFO ] [Real]Absence check using state equation in 1473 ms returned sat
[2025-05-29 17:43:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:41] [INFO ] [Nat]Absence check using 93 positive place invariants in 49 ms returned sat
[2025-05-29 17:43:41] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 69 ms returned sat
[2025-05-29 17:43:42] [INFO ] [Nat]Absence check using state equation in 1100 ms returned sat
[2025-05-29 17:43:42] [INFO ] Deduced a trap composed of 63 places in 297 ms of which 26 ms to minimize.
[2025-05-29 17:43:42] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 3 ms to minimize.
[2025-05-29 17:43:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 813 ms
[2025-05-29 17:43:43] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 185 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-29 17:43:46] [INFO ] [Real]Absence check using 93 positive place invariants in 46 ms returned sat
[2025-05-29 17:43:46] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 76 ms returned sat
[2025-05-29 17:43:48] [INFO ] [Real]Absence check using state equation in 1803 ms returned sat
[2025-05-29 17:43:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:48] [INFO ] [Nat]Absence check using 93 positive place invariants in 53 ms returned sat
[2025-05-29 17:43:48] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 74 ms returned sat
[2025-05-29 17:43:49] [INFO ] [Nat]Absence check using state equation in 1377 ms returned sat
[2025-05-29 17:43:50] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 166 ms.
[2025-05-29 17:43:51] [INFO ] Added : 25 causal constraints over 5 iterations in 1409 ms. Result :sat
Minimization took 633 ms.
[2025-05-29 17:43:52] [INFO ] [Real]Absence check using 93 positive place invariants in 43 ms returned sat
[2025-05-29 17:43:52] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 81 ms returned sat
[2025-05-29 17:43:53] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2025-05-29 17:43:53] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 161 ms.
[2025-05-29 17:43:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:54] [INFO ] [Nat]Absence check using 93 positive place invariants in 47 ms returned sat
[2025-05-29 17:43:54] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 80 ms returned sat
[2025-05-29 17:43:55] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2025-05-29 17:43:55] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 133 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:43:59] [INFO ] [Real]Absence check using 93 positive place invariants in 51 ms returned sat
[2025-05-29 17:43:59] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 90 ms returned sat
[2025-05-29 17:44:00] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2025-05-29 17:44:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:01] [INFO ] [Nat]Absence check using 93 positive place invariants in 47 ms returned sat
[2025-05-29 17:44:01] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 81 ms returned sat
[2025-05-29 17:44:02] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2025-05-29 17:44:02] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2025-05-29 17:44:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2025-05-29 17:44:02] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 134 ms.
[2025-05-29 17:44: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: Stream close... 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: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:44:06] [INFO ] [Real]Absence check using 93 positive place invariants in 47 ms returned sat
[2025-05-29 17:44:06] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 76 ms returned sat
[2025-05-29 17:44:07] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2025-05-29 17:44:07] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 137 ms.
[2025-05-29 17:44:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:08] [INFO ] [Nat]Absence check using 93 positive place invariants in 45 ms returned sat
[2025-05-29 17:44:08] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 82 ms returned sat
[2025-05-29 17:44:09] [INFO ] [Nat]Absence check using state equation in 1233 ms returned sat
[2025-05-29 17:44:09] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2025-05-29 17:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2025-05-29 17:44:09] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 148 ms.
[2025-05-29 17:44:12] [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 4
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:44:13] [INFO ] [Real]Absence check using 93 positive place invariants in 43 ms returned sat
[2025-05-29 17:44:13] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 78 ms returned sat
[2025-05-29 17:44:14] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2025-05-29 17:44:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:14] [INFO ] [Nat]Absence check using 93 positive place invariants in 46 ms returned sat
[2025-05-29 17:44:14] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 77 ms returned sat
[2025-05-29 17:44:15] [INFO ] [Nat]Absence check using state equation in 1064 ms returned sat
[2025-05-29 17:44:16] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 137 ms.
[2025-05-29 17:44:19] [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 5
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:44:19] [INFO ] [Real]Absence check using 93 positive place invariants in 44 ms returned sat
[2025-05-29 17:44:19] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 90 ms returned sat
[2025-05-29 17:44:20] [INFO ] [Real]Absence check using state equation in 949 ms returned sat
[2025-05-29 17:44:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:21] [INFO ] [Nat]Absence check using 93 positive place invariants in 45 ms returned sat
[2025-05-29 17:44:21] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 77 ms returned sat
[2025-05-29 17:44:22] [INFO ] [Nat]Absence check using state equation in 976 ms returned sat
[2025-05-29 17:44:22] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 5 ms to minimize.
[2025-05-29 17:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2025-05-29 17:44:22] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 135 ms.
[2025-05-29 17:44:25] [INFO ] Added : 80 causal constraints over 16 iterations in 3222 ms. Result :unknown
[2025-05-29 17:44:26] [INFO ] [Real]Absence check using 93 positive place invariants in 45 ms returned sat
[2025-05-29 17:44:26] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 79 ms returned sat
[2025-05-29 17:44:27] [INFO ] [Real]Absence check using state equation in 1366 ms returned sat
[2025-05-29 17:44:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:28] [INFO ] [Nat]Absence check using 93 positive place invariants in 49 ms returned sat
[2025-05-29 17:44:28] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 76 ms returned sat
[2025-05-29 17:44:29] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2025-05-29 17:44:29] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 135 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using 93 positive place invariants in 45 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 82 ms returned sat
[2025-05-29 17:44:34] [INFO ] [Real]Absence check using state equation in 1379 ms returned sat
[2025-05-29 17:44:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:35] [INFO ] [Nat]Absence check using 93 positive place invariants in 45 ms returned sat
[2025-05-29 17:44:35] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 78 ms returned sat
[2025-05-29 17:44:36] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2025-05-29 17:44:36] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 151 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:44:40] [INFO ] [Real]Absence check using 93 positive place invariants in 45 ms returned sat
[2025-05-29 17:44:40] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 74 ms returned sat
[2025-05-29 17:44:41] [INFO ] [Real]Absence check using state equation in 1228 ms returned sat
[2025-05-29 17:44:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:41] [INFO ] [Nat]Absence check using 93 positive place invariants in 46 ms returned sat
[2025-05-29 17:44:41] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 91 ms returned sat
[2025-05-29 17:44:43] [INFO ] [Nat]Absence check using state equation in 1363 ms returned sat
[2025-05-29 17:44:43] [INFO ] Deduced a trap composed of 25 places in 544 ms of which 8 ms to minimize.
[2025-05-29 17:44:44] [INFO ] Deduced a trap composed of 41 places in 552 ms of which 8 ms to minimize.
[2025-05-29 17:44:44] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 2 ms to minimize.
[2025-05-29 17:44:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1565 ms
[2025-05-29 17:44:44] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 161 ms.
[2025-05-29 17:44:46] [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 9
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:44:46] [INFO ] [Real]Absence check using 93 positive place invariants in 42 ms returned sat
[2025-05-29 17:44:46] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 73 ms returned sat
[2025-05-29 17:44:47] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2025-05-29 17:44:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:48] [INFO ] [Nat]Absence check using 93 positive place invariants in 47 ms returned sat
[2025-05-29 17:44:48] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 69 ms returned sat
[2025-05-29 17:44:50] [INFO ] [Nat]Absence check using state equation in 1745 ms returned sat
[2025-05-29 17:44:50] [INFO ] Deduced a trap composed of 24 places in 469 ms of which 6 ms to minimize.
[2025-05-29 17:44:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 665 ms
[2025-05-29 17:44:50] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 142 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1937 transition count 2706
Reduce places removed 182 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 183 rules applied. Total rules applied 419 place count 1755 transition count 2705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 420 place count 1754 transition count 2705
Performed 187 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 187 Pre rules applied. Total rules applied 420 place count 1754 transition count 2518
Deduced a syphon composed of 187 places in 3 ms
Ensure Unique test removed 74 places
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 868 place count 1493 transition count 2518
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 3 with 1 rules applied. Total rules applied 869 place count 1493 transition count 2517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 870 place count 1492 transition count 2517
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 882 place count 1480 transition count 2452
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 895 place count 1479 transition count 2452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 901 place count 1478 transition count 2447
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 904 place count 1475 transition count 2447
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 905 place count 1474 transition count 2439
Iterating global reduction 7 with 1 rules applied. Total rules applied 906 place count 1474 transition count 2439
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 907 place count 1473 transition count 2431
Iterating global reduction 7 with 1 rules applied. Total rules applied 908 place count 1473 transition count 2431
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 1472 transition count 2423
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 1472 transition count 2423
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 911 place count 1471 transition count 2415
Iterating global reduction 7 with 1 rules applied. Total rules applied 912 place count 1471 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 913 place count 1470 transition count 2407
Iterating global reduction 7 with 1 rules applied. Total rules applied 914 place count 1470 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 915 place count 1469 transition count 2399
Iterating global reduction 7 with 1 rules applied. Total rules applied 916 place count 1469 transition count 2399
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 917 place count 1468 transition count 2391
Iterating global reduction 7 with 1 rules applied. Total rules applied 918 place count 1468 transition count 2391
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 919 place count 1467 transition count 2383
Iterating global reduction 7 with 1 rules applied. Total rules applied 920 place count 1467 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 921 place count 1466 transition count 2375
Iterating global reduction 7 with 1 rules applied. Total rules applied 922 place count 1466 transition count 2375
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 923 place count 1465 transition count 2367
Iterating global reduction 7 with 1 rules applied. Total rules applied 924 place count 1465 transition count 2367
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 925 place count 1464 transition count 2359
Iterating global reduction 7 with 1 rules applied. Total rules applied 926 place count 1464 transition count 2359
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 927 place count 1463 transition count 2351
Iterating global reduction 7 with 1 rules applied. Total rules applied 928 place count 1463 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 929 place count 1462 transition count 2343
Iterating global reduction 7 with 1 rules applied. Total rules applied 930 place count 1462 transition count 2343
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 931 place count 1461 transition count 2335
Iterating global reduction 7 with 1 rules applied. Total rules applied 932 place count 1461 transition count 2335
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 933 place count 1460 transition count 2327
Iterating global reduction 7 with 1 rules applied. Total rules applied 934 place count 1460 transition count 2327
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 935 place count 1459 transition count 2319
Iterating global reduction 7 with 1 rules applied. Total rules applied 936 place count 1459 transition count 2319
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 7 with 126 rules applied. Total rules applied 1062 place count 1396 transition count 2256
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1070 place count 1396 transition count 2248
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1078 place count 1388 transition count 2248
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 1087 place count 1388 transition count 2248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1088 place count 1387 transition count 2247
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1106 place count 1369 transition count 2247
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 36 Pre rules applied. Total rules applied 1106 place count 1369 transition count 2211
Deduced a syphon composed of 36 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 9 with 73 rules applied. Total rules applied 1179 place count 1332 transition count 2211
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 9 with 11 rules applied. Total rules applied 1190 place count 1321 transition count 2211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1190 place count 1321 transition count 2210
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1192 place count 1320 transition count 2210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1212 place count 1310 transition count 2200
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1221 place count 1301 transition count 2191
Iterating global reduction 10 with 9 rules applied. Total rules applied 1230 place count 1301 transition count 2191
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1240 place count 1301 transition count 2181
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1250 place count 1291 transition count 2181
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 1259 place count 1291 transition count 2181
Applied a total of 1259 rules in 2038 ms. Remains 1291 /1991 variables (removed 700) and now considering 2181/2888 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2047 ms. Remains : 1291/1991 places, 2181/2888 transitions.
// Phase 1: matrix 2181 rows 1291 cols
[2025-05-29 17:44:56] [INFO ] Computed 224 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-09a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (9818 resets) in 3398 ms. (294 steps per ms)
FORMULA ASLink-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000005 steps (6499 resets) in 9106 ms. (658 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]
[2025-05-29 17:45:09] [INFO ] Invariant cache hit.
[2025-05-29 17:45:09] [INFO ] [Real]Absence check using 61 positive place invariants in 27 ms returned sat
[2025-05-29 17:45:09] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 33 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2025-05-29 17:45:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2025-05-29 17:45:11] [INFO ] Computed and/alt/rep : 869/3274/869 causal constraints (skipped 1267 transitions) in 111 ms.
[2025-05-29 17:45:24] [INFO ] Added : 636 causal constraints over 128 iterations in 13719 ms. Result :sat
Minimization took 1582 ms.
[2025-05-29 17:45:26] [INFO ] [Real]Absence check using 61 positive place invariants in 17 ms returned sat
[2025-05-29 17:45:26] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:45:27] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2025-05-29 17:45:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:27] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2025-05-29 17:45:27] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:45:28] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2025-05-29 17:45:28] [INFO ] Computed and/alt/rep : 869/3274/869 causal constraints (skipped 1267 transitions) in 106 ms.
[2025-05-29 17:45:42] [INFO ] Added : 653 causal constraints over 131 iterations in 14157 ms. Result :sat
Minimization took 1654 ms.
[2025-05-29 17:45:44] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2025-05-29 17:45:44] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:45:44] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2025-05-29 17:45:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2025-05-29 17:45:45] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:45:45] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2025-05-29 17:45:45] [INFO ] Computed and/alt/rep : 869/3274/869 causal constraints (skipped 1267 transitions) in 114 ms.
[2025-05-29 17:45:59] [INFO ] Added : 611 causal constraints over 123 iterations in 13477 ms. Result :sat
Minimization took 1608 ms.
[2025-05-29 17:46:01] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:46:01] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 36 ms returned sat
[2025-05-29 17:46:01] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2025-05-29 17:46:02] [INFO ] Computed and/alt/rep : 869/3274/869 causal constraints (skipped 1267 transitions) in 99 ms.
[2025-05-29 17:46:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:02] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:46:02] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:46:03] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2025-05-29 17:46:03] [INFO ] Computed and/alt/rep : 869/3274/869 causal constraints (skipped 1267 transitions) in 114 ms.
[2025-05-29 17:46:17] [INFO ] Added : 687 causal constraints over 138 iterations in 14312 ms. Result :sat
Minimization took 1487 ms.
[2025-05-29 17:46:19] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2025-05-29 17:46:19] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 43 ms returned sat
[2025-05-29 17:46:19] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2025-05-29 17:46:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 18 ms returned sat
[2025-05-29 17:46:20] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 33 ms returned sat
[2025-05-29 17:46:20] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2025-05-29 17:46:21] [INFO ] Computed and/alt/rep : 869/3274/869 causal constraints (skipped 1267 transitions) in 121 ms.
[2025-05-29 17:46:34] [INFO ] Added : 638 causal constraints over 128 iterations in 13917 ms. Result :sat
Minimization took 1547 ms.
[2025-05-29 17:46:36] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:46:36] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 38 ms returned sat
[2025-05-29 17:46:37] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2025-05-29 17:46:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:37] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2025-05-29 17:46:37] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:46:38] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2025-05-29 17:46:38] [INFO ] Computed and/alt/rep : 869/3274/869 causal constraints (skipped 1267 transitions) in 113 ms.
[2025-05-29 17:46:45] [INFO ] Added : 207 causal constraints over 44 iterations in 6849 ms. Result :sat
Minimization took 1937 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1291/1291 places, 2181/2181 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1291 transition count 2180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1290 transition count 2180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1290 transition count 2179
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1289 transition count 2179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1288 transition count 2178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1287 transition count 2177
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1287 transition count 2177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 1287 transition count 2176
Applied a total of 9 rules in 130 ms. Remains 1287 /1291 variables (removed 4) and now considering 2176/2181 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 1287/1291 places, 2176/2181 transitions.
// Phase 1: matrix 2176 rows 1287 cols
[2025-05-29 17:46:54] [INFO ] Computed 224 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9860 resets) in 3307 ms. (302 steps per ms)
FORMULA ASLink-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (5410 resets) in 7600 ms. (657 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 17:47:05] [INFO ] Invariant cache hit.
[2025-05-29 17:47:05] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2025-05-29 17:47:05] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 30 ms returned sat
[2025-05-29 17:47:06] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2025-05-29 17:47:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:06] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2025-05-29 17:47:06] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:47:07] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2025-05-29 17:47:07] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 109 ms.
[2025-05-29 17:47:22] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 1 ms to minimize.
[2025-05-29 17:47:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2025-05-29 17:47:22] [INFO ] Added : 702 causal constraints over 141 iterations in 15421 ms. Result :sat
Minimization took 1523 ms.
[2025-05-29 17:47:24] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:47:24] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 33 ms returned sat
[2025-05-29 17:47:24] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2025-05-29 17:47:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:25] [INFO ] [Nat]Absence check using 61 positive place invariants in 25 ms returned sat
[2025-05-29 17:47:25] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 29 ms returned sat
[2025-05-29 17:47:25] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2025-05-29 17:47:26] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 110 ms.
[2025-05-29 17:47:41] [INFO ] Added : 653 causal constraints over 131 iterations in 15110 ms. Result :sat
Minimization took 1350 ms.
[2025-05-29 17:47:42] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2025-05-29 17:47:42] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:47:43] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2025-05-29 17:47:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 18 ms returned sat
[2025-05-29 17:47:43] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 30 ms returned sat
[2025-05-29 17:47:44] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2025-05-29 17:47:44] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 107 ms.
[2025-05-29 17:47:58] [INFO ] Added : 656 causal constraints over 132 iterations in 14369 ms. Result :sat
Minimization took 1279 ms.
[2025-05-29 17:48:00] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2025-05-29 17:48:00] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:48:00] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2025-05-29 17:48:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:00] [INFO ] [Nat]Absence check using 61 positive place invariants in 27 ms returned sat
[2025-05-29 17:48:00] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 30 ms returned sat
[2025-05-29 17:48:01] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2025-05-29 17:48:01] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 111 ms.
[2025-05-29 17:48:15] [INFO ] Added : 673 causal constraints over 135 iterations in 14194 ms. Result :sat
Minimization took 1338 ms.
[2025-05-29 17:48:17] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2025-05-29 17:48:17] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:48:18] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2025-05-29 17:48:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:18] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:48:18] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 39 ms returned sat
[2025-05-29 17:48:19] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2025-05-29 17:48:19] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 110 ms.
[2025-05-29 17:48:40] [INFO ] Added : 565 causal constraints over 113 iterations in 20983 ms.(timeout) Result :sat
Minimization took 4504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1287/1287 places, 2176/2176 transitions.
Applied a total of 0 rules in 38 ms. Remains 1287 /1287 variables (removed 0) and now considering 2176/2176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1287/1287 places, 2176/2176 transitions.
[2025-05-29 17:48:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9909 resets) in 3317 ms. (301 steps per ms)
BEST_FIRST walk for 5000004 steps (5397 resets) in 7554 ms. (661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 17:48:58] [INFO ] Invariant cache hit.
[2025-05-29 17:48:58] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:48:58] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 37 ms returned sat
[2025-05-29 17:48:59] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2025-05-29 17:48:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:59] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2025-05-29 17:48:59] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 30 ms returned sat
[2025-05-29 17:49:00] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2025-05-29 17:49:00] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 111 ms.
[2025-05-29 17:49:16] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2025-05-29 17:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2025-05-29 17:49:16] [INFO ] Added : 702 causal constraints over 141 iterations in 15924 ms. Result :sat
Minimization took 1451 ms.
[2025-05-29 17:49:17] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:49:18] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 38 ms returned sat
[2025-05-29 17:49:18] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2025-05-29 17:49:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:18] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2025-05-29 17:49:18] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:49:19] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2025-05-29 17:49:19] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 111 ms.
[2025-05-29 17:49:34] [INFO ] Added : 653 causal constraints over 131 iterations in 14886 ms. Result :sat
Minimization took 1372 ms.
[2025-05-29 17:49:36] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:49:36] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 49 ms returned sat
[2025-05-29 17:49:36] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2025-05-29 17:49:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:37] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:49:37] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:49:37] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2025-05-29 17:49:37] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 110 ms.
[2025-05-29 17:49:51] [INFO ] Added : 656 causal constraints over 132 iterations in 14122 ms. Result :sat
Minimization took 1238 ms.
[2025-05-29 17:49:53] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2025-05-29 17:49:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:54] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:49:54] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:49:54] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2025-05-29 17:49:54] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 111 ms.
[2025-05-29 17:50:09] [INFO ] Added : 673 causal constraints over 135 iterations in 14395 ms. Result :sat
Minimization took 1374 ms.
[2025-05-29 17:50:10] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2025-05-29 17:50:10] [INFO ] [Real]Absence check using 61 positive and 163 generalized place invariants in 33 ms returned sat
[2025-05-29 17:50:11] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2025-05-29 17:50:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:11] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2025-05-29 17:50:11] [INFO ] [Nat]Absence check using 61 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:50:12] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2025-05-29 17:50:12] [INFO ] Computed and/alt/rep : 871/3322/871 causal constraints (skipped 1260 transitions) in 112 ms.
[2025-05-29 17:50:37] [INFO ] Added : 565 causal constraints over 113 iterations in 24635 ms.(timeout) Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1287/1287 places, 2176/2176 transitions.
Applied a total of 0 rules in 37 ms. Remains 1287 /1287 variables (removed 0) and now considering 2176/2176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1287/1287 places, 2176/2176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1287/1287 places, 2176/2176 transitions.
Applied a total of 0 rules in 50 ms. Remains 1287 /1287 variables (removed 0) and now considering 2176/2176 (removed 0) transitions.
[2025-05-29 17:50:44] [INFO ] Invariant cache hit.
[2025-05-29 17:50:45] [INFO ] Implicit Places using invariants in 937 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 346, 380, 384, 385, 396, 397, 398, 416, 434, 503, 507, 508, 519, 520, 521, 539, 557, 626, 630, 631, 642, 643, 644, 662, 680, 749, 753, 754, 765, 766, 767, 785, 803, 872, 876, 877, 888, 889, 890, 908, 926, 995, 999, 1000, 1011, 1012, 1013, 1031, 1049, 1068, 1118, 1119, 1122, 1133, 1134, 1135, 1153, 1155, 1158, 1176, 1177, 1178, 1179, 1191, 1197, 1203, 1209, 1215, 1221, 1227, 1233, 1239, 1245, 1251]
[2025-05-29 17:50:45] [INFO ] Actually due to overlaps returned [1153, 1135, 30, 48, 150, 168, 273, 291, 398, 416, 521, 539, 644, 662, 767, 785, 890, 908, 1031, 1158, 1013, 149, 272, 397, 520, 643, 766, 889, 1012, 1134, 1177, 148, 271, 396, 519, 642, 765, 888, 1011, 1133, 1155, 1176, 0, 259, 260, 384, 385, 507, 508, 630, 631, 753, 754, 876, 877, 999, 1000, 1118, 1119, 18, 19, 66, 186, 309, 434, 557, 680, 803, 926, 1179, 1221, 1239, 1251, 1049, 1068, 1122, 1178, 1191, 1197, 1203, 1209, 1215, 1227, 1233, 1245]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 941 ms to find 85 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1202/1287 places, 2176/2176 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 1193 transition count 2013
Reduce places removed 163 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 164 rules applied. Total rules applied 336 place count 1030 transition count 2012
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 1029 transition count 2012
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 337 place count 1029 transition count 1970
Deduced a syphon composed of 42 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 422 place count 986 transition count 1970
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 434 place count 982 transition count 1962
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 442 place count 974 transition count 1962
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 457 place count 959 transition count 1947
Iterating global reduction 5 with 15 rules applied. Total rules applied 472 place count 959 transition count 1947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 475 place count 959 transition count 1944
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 475 place count 959 transition count 1943
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 477 place count 958 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 480 place count 955 transition count 1940
Iterating global reduction 6 with 3 rules applied. Total rules applied 483 place count 955 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 484 place count 954 transition count 1939
Iterating global reduction 6 with 1 rules applied. Total rules applied 485 place count 954 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 486 place count 953 transition count 1938
Iterating global reduction 6 with 1 rules applied. Total rules applied 487 place count 953 transition count 1938
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 637 place count 878 transition count 1863
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 646 place count 878 transition count 1854
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 654 place count 870 transition count 1846
Iterating global reduction 7 with 8 rules applied. Total rules applied 662 place count 870 transition count 1846
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 670 place count 870 transition count 1838
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 689 place count 870 transition count 1819
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 709 place count 850 transition count 1819
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 737 place count 850 transition count 1819
Applied a total of 737 rules in 321 ms. Remains 850 /1202 variables (removed 352) and now considering 1819/2176 (removed 357) transitions.
// Phase 1: matrix 1819 rows 850 cols
[2025-05-29 17:50:46] [INFO ] Computed 124 invariants in 15 ms
[2025-05-29 17:50:46] [INFO ] Implicit Places using invariants in 596 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 262, 268, 271, 273, 278, 279, 331, 348, 354, 357, 359, 364, 365, 417, 434, 440, 443, 445, 450, 451, 503, 520, 526, 529, 531, 536, 537, 589, 606, 612, 615, 617, 622, 623, 675, 693, 699, 702, 704, 709, 710, 776, 782, 785, 787]
[2025-05-29 17:50:46] [INFO ] Actually due to overlaps returned [104, 190, 278, 364, 450, 536, 622, 709, 105, 191, 279, 365, 451, 537, 623, 710, 89, 95, 100, 101, 174, 180, 185, 262, 268, 273, 348, 354, 359, 434, 440, 445, 520, 526, 531, 606, 612, 617, 693, 699, 704, 776, 782, 787, 72, 157, 243, 331, 417, 503, 589, 675]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 602 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 798/1287 places, 1819/2176 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 762 transition count 1783
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 762 transition count 1783
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 753 transition count 1774
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 753 transition count 1774
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 124 place count 736 transition count 1757
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 151 place count 736 transition count 1730
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 178 place count 709 transition count 1730
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 709 transition count 1722
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 194 place count 701 transition count 1722
Applied a total of 194 rules in 163 ms. Remains 701 /798 variables (removed 97) and now considering 1722/1819 (removed 97) transitions.
// Phase 1: matrix 1722 rows 701 cols
[2025-05-29 17:50:46] [INFO ] Computed 72 invariants in 22 ms
[2025-05-29 17:50:47] [INFO ] Implicit Places using invariants in 418 ms returned []
[2025-05-29 17:50:47] [INFO ] Invariant cache hit.
[2025-05-29 17:50:48] [INFO ] Implicit Places using invariants and state equation in 1381 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 701/1287 places, 1722/2176 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3881 ms. Remains : 701/1287 places, 1722/2176 transitions.
[2025-05-29 17:50:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (16663 resets) in 2271 ms. (440 steps per ms)
FORMULA ASLink-PT-09a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (10172 resets) in 3292 ms. (1214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:50:54] [INFO ] Invariant cache hit.
[2025-05-29 17:50:54] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:54] [INFO ] [Real]Absence check using 16 positive and 56 generalized place invariants in 15 ms returned sat
[2025-05-29 17:50:54] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2025-05-29 17:50:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:54] [INFO ] [Nat]Absence check using 16 positive and 56 generalized place invariants in 14 ms returned sat
[2025-05-29 17:50:55] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2025-05-29 17:50:55] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2025-05-29 17:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2025-05-29 17:50:55] [INFO ] Computed and/alt/rep : 394/1681/394 causal constraints (skipped 1286 transitions) in 73 ms.
[2025-05-29 17:50:56] [INFO ] Added : 22 causal constraints over 5 iterations in 497 ms. Result :sat
Minimization took 768 ms.
[2025-05-29 17:50:57] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:57] [INFO ] [Real]Absence check using 16 positive and 56 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:57] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-05-29 17:50:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:57] [INFO ] [Nat]Absence check using 16 positive and 56 generalized place invariants in 15 ms returned sat
[2025-05-29 17:50:58] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2025-05-29 17:50:58] [INFO ] Computed and/alt/rep : 394/1681/394 causal constraints (skipped 1286 transitions) in 84 ms.
[2025-05-29 17:50:59] [INFO ] Added : 61 causal constraints over 13 iterations in 1247 ms. Result :sat
Minimization took 835 ms.
[2025-05-29 17:51:00] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:51:00] [INFO ] [Real]Absence check using 16 positive and 56 generalized place invariants in 17 ms returned sat
[2025-05-29 17:51:01] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2025-05-29 17:51:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:51:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2025-05-29 17:51:01] [INFO ] [Nat]Absence check using 16 positive and 56 generalized place invariants in 16 ms returned sat
[2025-05-29 17:51:01] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2025-05-29 17:51:01] [INFO ] Computed and/alt/rep : 394/1681/394 causal constraints (skipped 1286 transitions) in 86 ms.
[2025-05-29 17:51:02] [INFO ] Added : 43 causal constraints over 9 iterations in 1039 ms. Result :sat
Minimization took 829 ms.
[2025-05-29 17:51:03] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:51:03] [INFO ] [Real]Absence check using 16 positive and 56 generalized place invariants in 16 ms returned sat
[2025-05-29 17:51:04] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2025-05-29 17:51:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:51:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:51:04] [INFO ] [Nat]Absence check using 16 positive and 56 generalized place invariants in 14 ms returned sat
[2025-05-29 17:51:05] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2025-05-29 17:51:05] [INFO ] Computed and/alt/rep : 394/1681/394 causal constraints (skipped 1286 transitions) in 82 ms.
[2025-05-29 17:51:06] [INFO ] Added : 21 causal constraints over 5 iterations in 1240 ms. Result :sat
Minimization took 801 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09a-UpperBounds-08 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 701 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p504) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 1721/1721 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 4309 edges and 700 vertex of which 699 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 699 transition count 1719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 698 transition count 1719
Applied a total of 4 rules in 29 ms. Remains 698 /701 variables (removed 3) and now considering 1719/1721 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 698/701 places, 1719/1721 transitions.
// Phase 1: matrix 1719 rows 698 cols
[2025-05-29 17:51:08] [INFO ] Computed 71 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16825 resets) in 2191 ms. (456 steps per ms)
BEST_FIRST walk for 1000001 steps (2528 resets) in 813 ms. (1228 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:51:11] [INFO ] Invariant cache hit.
[2025-05-29 17:51:11] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-29 17:51:11] [INFO ] [Real]Absence check using 19 positive and 52 generalized place invariants in 14 ms returned sat
[2025-05-29 17:51:12] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2025-05-29 17:51:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:51:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-29 17:51:12] [INFO ] [Nat]Absence check using 19 positive and 52 generalized place invariants in 14 ms returned sat
[2025-05-29 17:51:12] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2025-05-29 17:51:12] [INFO ] Computed and/alt/rep : 391/1677/391 causal constraints (skipped 1286 transitions) in 88 ms.
[2025-05-29 17:51:13] [INFO ] Added : 14 causal constraints over 3 iterations in 378 ms. Result :sat
Minimization took 792 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 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1719/1719 transitions.
Applied a total of 0 rules in 20 ms. Remains 698 /698 variables (removed 0) and now considering 1719/1719 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 698/698 places, 1719/1719 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1719/1719 transitions.
Applied a total of 0 rules in 20 ms. Remains 698 /698 variables (removed 0) and now considering 1719/1719 (removed 0) transitions.
[2025-05-29 17:51:14] [INFO ] Invariant cache hit.
[2025-05-29 17:51:14] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-05-29 17:51:14] [INFO ] Invariant cache hit.
[2025-05-29 17:51:16] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2025-05-29 17:51:16] [INFO ] Redundant transitions in 119 ms returned []
Running 1677 sub problems to find dead transitions.
[2025-05-29 17:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1677 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 1677 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/2417 variables, and 63 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 49/52 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1677 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 1677 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s215 1)
(s216 1)
(s217 1)
(s218 6)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 0)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 1)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/2417 variables, and 63 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 49/52 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 61132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63248 ms. Remains : 698/698 places, 1719/1719 transitions.
RANDOM walk for 40000 steps (687 resets) in 796 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (101 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2025-05-29 17:52:18] [INFO ] Flatten gal took : 191 ms
[2025-05-29 17:52:18] [INFO ] Flatten gal took : 115 ms
[2025-05-29 17:52:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8821544652239146540.gal : 121 ms
[2025-05-29 17:52:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16135093510215713776.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8821544652239146540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16135093510215713776.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16135093510215713776.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2448 after 136384
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :136384 after 2.43147e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.43147e+08 after 4.67261e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.67261e+08 after 4.78888e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.78888e+08 after 4.78926e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.78926e+08 after 1.68314e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.68314e+10 after 2.59621e+11
Interrupted probabilistic random walk after 216856 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 216856 steps, saw 144237 distinct states, run finished after 3004 ms. (steps per millisecond=72 ) properties seen :0
[2025-05-29 17:52:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 190/244 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/251 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 193/444 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
After SMT solving in domain Real declared 459/2417 variables, and 43 constraints, problems are : Problem set: 2 solved, 0 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 12/19 constraints, Generalized P Invariants (flows): 31/52 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-09a-UpperBounds-01 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 523718 ms.

BK_STOP 1748541141218

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-09a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is ASLink-PT-09a, 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 r013-tall-174853743000052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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