About the Execution of 2024-gold for ASLink-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15683.990 | 345548.00 | 418714.00 | 917.60 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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-174853743000049.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-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000049
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-07b-UpperBounds-00
FORMULA_NAME ASLink-PT-07b-UpperBounds-01
FORMULA_NAME ASLink-PT-07b-UpperBounds-02
FORMULA_NAME ASLink-PT-07b-UpperBounds-03
FORMULA_NAME ASLink-PT-07b-UpperBounds-04
FORMULA_NAME ASLink-PT-07b-UpperBounds-05
FORMULA_NAME ASLink-PT-07b-UpperBounds-06
FORMULA_NAME ASLink-PT-07b-UpperBounds-07
FORMULA_NAME ASLink-PT-07b-UpperBounds-08
FORMULA_NAME ASLink-PT-07b-UpperBounds-09
FORMULA_NAME ASLink-PT-07b-UpperBounds-10
FORMULA_NAME ASLink-PT-07b-UpperBounds-11
FORMULA_NAME ASLink-PT-07b-UpperBounds-12
FORMULA_NAME ASLink-PT-07b-UpperBounds-13
FORMULA_NAME ASLink-PT-07b-UpperBounds-14
FORMULA_NAME ASLink-PT-07b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748540455058
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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:40:56] [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:40:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:40:56] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2025-05-29 17:40:56] [INFO ] Transformed 3222 places.
[2025-05-29 17:40:56] [INFO ] Transformed 3986 transitions.
[2025-05-29 17:40:56] [INFO ] Found NUPN structural information;
[2025-05-29 17:40:56] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 644 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 28 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3986 rows 3222 cols
[2025-05-29 17:40:57] [INFO ] Computed 316 invariants in 190 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 (15 resets) in 92 ms. (107 steps per ms)
FORMULA ASLink-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 141 ms. (704 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:40:57] [INFO ] Invariant cache hit.
[2025-05-29 17:40:58] [INFO ] [Real]Absence check using 75 positive place invariants in 103 ms returned sat
[2025-05-29 17:40:58] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 105 ms returned sat
[2025-05-29 17:41:01] [INFO ] [Real]Absence check using state equation in 2357 ms returned sat
[2025-05-29 17:41:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:01] [INFO ] [Nat]Absence check using 75 positive place invariants in 91 ms returned sat
[2025-05-29 17:41:02] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 91 ms returned sat
[2025-05-29 17:41:03] [INFO ] [Nat]Absence check using state equation in 1898 ms returned sat
[2025-05-29 17:41:04] [INFO ] Deduced a trap composed of 98 places in 830 ms of which 75 ms to minimize.
[2025-05-29 17:41:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1202 ms
[2025-05-29 17:41:05] [INFO ] Computed and/alt/rep : 3362/7344/3362 causal constraints (skipped 623 transitions) in 262 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-29 17:41:06] [INFO ] [Real]Absence check using 75 positive place invariants in 122 ms returned sat
[2025-05-29 17:41:07] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 99 ms returned sat
[2025-05-29 17:41:08] [INFO ] [Real]Absence check using state equation in 1642 ms returned sat
[2025-05-29 17:41:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:09] [INFO ] [Nat]Absence check using 75 positive place invariants in 81 ms returned sat
[2025-05-29 17:41:09] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 89 ms returned sat
[2025-05-29 17:41:12] [INFO ] [Nat]Absence check using state equation in 2815 ms returned sat
[2025-05-29 17:41:13] [INFO ] Deduced a trap composed of 23 places in 1322 ms of which 15 ms to minimize.
[2025-05-29 17:41:14] [INFO ] Deduced a trap composed of 54 places in 800 ms of which 8 ms to minimize.
[2025-05-29 17:41:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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:41:15] [INFO ] [Real]Absence check using 75 positive place invariants in 72 ms returned sat
[2025-05-29 17:41:15] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 93 ms returned sat
[2025-05-29 17:41:17] [INFO ] [Real]Absence check using state equation in 2064 ms returned sat
[2025-05-29 17:41:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:17] [INFO ] [Nat]Absence check using 75 positive place invariants in 76 ms returned sat
[2025-05-29 17:41:18] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 99 ms returned sat
[2025-05-29 17:41:20] [INFO ] [Nat]Absence check using state equation in 2622 ms returned sat
[2025-05-29 17:41:22] [INFO ] Deduced a trap composed of 61 places in 1373 ms of which 17 ms to minimize.
[2025-05-29 17:41:23] [INFO ] Deduced a trap composed of 24 places in 1454 ms of which 16 ms to minimize.
[2025-05-29 17:41:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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:41:24] [INFO ] [Real]Absence check using 75 positive place invariants in 72 ms returned sat
[2025-05-29 17:41:24] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 95 ms returned sat
[2025-05-29 17:41:26] [INFO ] [Real]Absence check using state equation in 2053 ms returned sat
[2025-05-29 17:41:28] [INFO ] Deduced a trap composed of 32 places in 1675 ms of which 18 ms to minimize.
[2025-05-29 17:41:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:28] [INFO ] [Nat]Absence check using 75 positive place invariants in 75 ms returned sat
[2025-05-29 17:41:29] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 89 ms returned sat
[2025-05-29 17:41:31] [INFO ] [Nat]Absence check using state equation in 2156 ms returned sat
[2025-05-29 17:41:33] [INFO ] Deduced a trap composed of 280 places in 1774 ms of which 19 ms to minimize.
[2025-05-29 17:41:34] [INFO ] Deduced a trap composed of 20 places in 1785 ms of which 21 ms to minimize.
[2025-05-29 17:41:34] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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:41:35] [INFO ] [Real]Absence check using 75 positive place invariants in 72 ms returned sat
[2025-05-29 17:41:35] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 111 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using state equation in 2600 ms returned sat
[2025-05-29 17:41:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:38] [INFO ] [Nat]Absence check using 75 positive place invariants in 75 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 97 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using state equation in 2810 ms returned sat
[2025-05-29 17:41:42] [INFO ] Deduced a trap composed of 22 places in 1080 ms of which 12 ms to minimize.
[2025-05-29 17:41:44] [INFO ] Deduced a trap composed of 55 places in 1039 ms of which 13 ms to minimize.
[2025-05-29 17:41:44] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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:41:44] [INFO ] [Real]Absence check using 75 positive place invariants in 78 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 92 ms returned sat
[2025-05-29 17:41:46] [INFO ] [Real]Absence check using state equation in 2159 ms returned sat
[2025-05-29 17:41:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:47] [INFO ] [Nat]Absence check using 75 positive place invariants in 76 ms returned sat
[2025-05-29 17:41:47] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 92 ms returned sat
[2025-05-29 17:41:50] [INFO ] [Nat]Absence check using state equation in 2747 ms returned sat
[2025-05-29 17:41:51] [INFO ] Deduced a trap composed of 27 places in 1009 ms of which 12 ms to minimize.
[2025-05-29 17:41:52] [INFO ] Deduced a trap composed of 30 places in 562 ms of which 7 ms to minimize.
[2025-05-29 17:41:52] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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:41:52] [INFO ] [Real]Absence check using 75 positive place invariants in 77 ms returned sat
[2025-05-29 17:41:52] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 90 ms returned sat
[2025-05-29 17:41:54] [INFO ] [Real]Absence check using state equation in 1723 ms returned sat
[2025-05-29 17:41:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:55] [INFO ] [Nat]Absence check using 75 positive place invariants in 78 ms returned sat
[2025-05-29 17:41:55] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 97 ms returned sat
[2025-05-29 17:41:56] [INFO ] [Nat]Absence check using state equation in 1526 ms returned sat
[2025-05-29 17:41:57] [INFO ] Computed and/alt/rep : 3362/7344/3362 causal constraints (skipped 623 transitions) in 211 ms.
[2025-05-29 17:41:59] [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 6
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:42:00] [INFO ] [Real]Absence check using 75 positive place invariants in 67 ms returned sat
[2025-05-29 17:42:00] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 82 ms returned sat
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using state equation in 2188 ms returned sat
[2025-05-29 17:42:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:03] [INFO ] [Nat]Absence check using 75 positive place invariants in 82 ms returned sat
[2025-05-29 17:42:03] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 84 ms returned sat
[2025-05-29 17:42:05] [INFO ] [Nat]Absence check using state equation in 2256 ms returned sat
[2025-05-29 17:42:05] [INFO ] Deduced a trap composed of 63 places in 457 ms of which 7 ms to minimize.
[2025-05-29 17:42:06] [INFO ] Deduced a trap composed of 174 places in 351 ms of which 6 ms to minimize.
[2025-05-29 17:42:06] [INFO ] Deduced a trap composed of 128 places in 389 ms of which 5 ms to minimize.
[2025-05-29 17:42:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1664 ms
[2025-05-29 17:42:07] [INFO ] Computed and/alt/rep : 3362/7344/3362 causal constraints (skipped 623 transitions) in 182 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:42:08] [INFO ] [Real]Absence check using 75 positive place invariants in 72 ms returned sat
[2025-05-29 17:42:08] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 90 ms returned sat
[2025-05-29 17:42:10] [INFO ] [Real]Absence check using state equation in 2551 ms returned sat
[2025-05-29 17:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 74 ms returned sat
[2025-05-29 17:42:11] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 89 ms returned sat
[2025-05-29 17:42:14] [INFO ] [Nat]Absence check using state equation in 2531 ms returned sat
[2025-05-29 17:42:16] [INFO ] Deduced a trap composed of 228 places in 1592 ms of which 17 ms to minimize.
[2025-05-29 17:42:17] [INFO ] Deduced a trap composed of 24 places in 1540 ms of which 17 ms to minimize.
[2025-05-29 17:42:17] [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 8
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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:42:18] [INFO ] [Real]Absence check using 75 positive place invariants in 84 ms returned sat
[2025-05-29 17:42:18] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 89 ms returned sat
[2025-05-29 17:42:20] [INFO ] [Real]Absence check using state equation in 1875 ms returned sat
[2025-05-29 17:42:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:20] [INFO ] [Nat]Absence check using 75 positive place invariants in 101 ms returned sat
[2025-05-29 17:42:20] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 88 ms returned sat
[2025-05-29 17:42:22] [INFO ] [Nat]Absence check using state equation in 2087 ms returned sat
[2025-05-29 17:42:24] [INFO ] Deduced a trap composed of 30 places in 1661 ms of which 18 ms to minimize.
[2025-05-29 17:42:26] [INFO ] Deduced a trap composed of 20 places in 1686 ms of which 18 ms to minimize.
[2025-05-29 17:42:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 749 transitions
Trivial Post-agglo rules discarded 749 transitions
Performed 749 trivial Post agglomeration. Transition count delta: 749
Iterating post reduction 0 with 749 rules applied. Total rules applied 749 place count 3222 transition count 3237
Reduce places removed 749 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 783 rules applied. Total rules applied 1532 place count 2473 transition count 3203
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1541 place count 2464 transition count 3203
Performed 742 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 742 Pre rules applied. Total rules applied 1541 place count 2464 transition count 2461
Deduced a syphon composed of 742 places in 5 ms
Ensure Unique test removed 71 places
Reduce places removed 813 places and 0 transitions.
Iterating global reduction 3 with 1555 rules applied. Total rules applied 3096 place count 1651 transition count 2461
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 3 with 54 rules applied. Total rules applied 3150 place count 1641 transition count 2417
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 46 rules applied. Total rules applied 3196 place count 1597 transition count 2415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3198 place count 1595 transition count 2415
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 3198 place count 1595 transition count 2387
Deduced a syphon composed of 28 places in 15 ms
Ensure Unique test removed 27 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 83 rules applied. Total rules applied 3281 place count 1540 transition count 2387
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 27 Pre rules applied. Total rules applied 3281 place count 1540 transition count 2360
Deduced a syphon composed of 27 places in 28 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 3335 place count 1513 transition count 2360
Discarding 103 places :
Symmetric choice reduction at 6 with 103 rule applications. Total rules 3438 place count 1410 transition count 2257
Iterating global reduction 6 with 103 rules applied. Total rules applied 3541 place count 1410 transition count 2257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3542 place count 1410 transition count 2256
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 34 Pre rules applied. Total rules applied 3542 place count 1410 transition count 2222
Deduced a syphon composed of 34 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 69 rules applied. Total rules applied 3611 place count 1375 transition count 2222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3611 place count 1375 transition count 2221
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 3614 place count 1373 transition count 2221
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 3622 place count 1365 transition count 2170
Iterating global reduction 7 with 8 rules applied. Total rules applied 3630 place count 1365 transition count 2170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 3630 place count 1365 transition count 2163
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 3644 place count 1358 transition count 2163
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3645 place count 1357 transition count 2155
Iterating global reduction 7 with 1 rules applied. Total rules applied 3646 place count 1357 transition count 2155
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3647 place count 1356 transition count 2147
Iterating global reduction 7 with 1 rules applied. Total rules applied 3648 place count 1356 transition count 2147
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3649 place count 1355 transition count 2139
Iterating global reduction 7 with 1 rules applied. Total rules applied 3650 place count 1355 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3651 place count 1354 transition count 2131
Iterating global reduction 7 with 1 rules applied. Total rules applied 3652 place count 1354 transition count 2131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3653 place count 1353 transition count 2123
Iterating global reduction 7 with 1 rules applied. Total rules applied 3654 place count 1353 transition count 2123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3655 place count 1352 transition count 2115
Iterating global reduction 7 with 1 rules applied. Total rules applied 3656 place count 1352 transition count 2115
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3657 place count 1351 transition count 2107
Iterating global reduction 7 with 1 rules applied. Total rules applied 3658 place count 1351 transition count 2107
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3659 place count 1350 transition count 2099
Iterating global reduction 7 with 1 rules applied. Total rules applied 3660 place count 1350 transition count 2099
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3661 place count 1349 transition count 2091
Iterating global reduction 7 with 1 rules applied. Total rules applied 3662 place count 1349 transition count 2091
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3663 place count 1348 transition count 2083
Iterating global reduction 7 with 1 rules applied. Total rules applied 3664 place count 1348 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3665 place count 1347 transition count 2075
Iterating global reduction 7 with 1 rules applied. Total rules applied 3666 place count 1347 transition count 2075
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3667 place count 1346 transition count 2067
Iterating global reduction 7 with 1 rules applied. Total rules applied 3668 place count 1346 transition count 2067
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3669 place count 1345 transition count 2059
Iterating global reduction 7 with 1 rules applied. Total rules applied 3670 place count 1345 transition count 2059
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3671 place count 1344 transition count 2051
Iterating global reduction 7 with 1 rules applied. Total rules applied 3672 place count 1344 transition count 2051
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3673 place count 1343 transition count 2043
Iterating global reduction 7 with 1 rules applied. Total rules applied 3674 place count 1343 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3675 place count 1342 transition count 2035
Iterating global reduction 7 with 1 rules applied. Total rules applied 3676 place count 1342 transition count 2035
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 2 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 7 with 372 rules applied. Total rules applied 4048 place count 1156 transition count 1849
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4049 place count 1155 transition count 1848
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 4051 place count 1154 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4052 place count 1153 transition count 1847
Iterating global reduction 7 with 1 rules applied. Total rules applied 4053 place count 1153 transition count 1847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4055 place count 1153 transition count 1845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4056 place count 1152 transition count 1845
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4058 place count 1151 transition count 1854
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 4067 place count 1151 transition count 1845
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 4076 place count 1142 transition count 1845
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 4083 place count 1142 transition count 1838
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 4090 place count 1135 transition count 1838
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4091 place count 1134 transition count 1837
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 17 rules applied. Total rules applied 4108 place count 1122 transition count 1832
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 4113 place count 1117 transition count 1832
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 17 Pre rules applied. Total rules applied 4113 place count 1117 transition count 1815
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 4147 place count 1100 transition count 1815
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 4153 place count 1094 transition count 1815
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 4179 place count 1081 transition count 1802
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 4185 place count 1075 transition count 1796
Iterating global reduction 14 with 6 rules applied. Total rules applied 4191 place count 1075 transition count 1796
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 4197 place count 1075 transition count 1790
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4203 place count 1069 transition count 1790
Applied a total of 4203 rules in 3523 ms. Remains 1069 /3222 variables (removed 2153) and now considering 1790/3986 (removed 2196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3553 ms. Remains : 1069/3222 places, 1790/3986 transitions.
// Phase 1: matrix 1790 rows 1069 cols
[2025-05-29 17:42:30] [INFO ] Computed 187 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10774 resets) in 3362 ms. (297 steps per ms)
FORMULA ASLink-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (7672 resets) in 6651 ms. (751 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:42:40] [INFO ] Invariant cache hit.
[2025-05-29 17:42:40] [INFO ] [Real]Absence check using 47 positive place invariants in 22 ms returned sat
[2025-05-29 17:42:40] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 27 ms returned sat
[2025-05-29 17:42:40] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2025-05-29 17:42:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:41] [INFO ] [Nat]Absence check using 47 positive place invariants in 31 ms returned sat
[2025-05-29 17:42:41] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 30 ms returned sat
[2025-05-29 17:42:41] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2025-05-29 17:42:41] [INFO ] Computed and/alt/rep : 721/2752/721 causal constraints (skipped 1031 transitions) in 93 ms.
[2025-05-29 17:42:51] [INFO ] Added : 555 causal constraints over 111 iterations in 10221 ms. Result :sat
Minimization took 1362 ms.
[2025-05-29 17:42:53] [INFO ] [Real]Absence check using 47 positive place invariants in 16 ms returned sat
[2025-05-29 17:42:53] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 31 ms returned sat
[2025-05-29 17:42:54] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2025-05-29 17:42:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:54] [INFO ] [Nat]Absence check using 47 positive place invariants in 24 ms returned sat
[2025-05-29 17:42:54] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 30 ms returned sat
[2025-05-29 17:42:55] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2025-05-29 17:42:55] [INFO ] Computed and/alt/rep : 721/2752/721 causal constraints (skipped 1031 transitions) in 111 ms.
[2025-05-29 17:43:04] [INFO ] Added : 542 causal constraints over 109 iterations in 9747 ms. Result :sat
Minimization took 1645 ms.
[2025-05-29 17:43:06] [INFO ] [Real]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:43:06] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 29 ms returned sat
[2025-05-29 17:43:07] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2025-05-29 17:43:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:07] [INFO ] [Nat]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:43:07] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 26 ms returned sat
[2025-05-29 17:43:07] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2025-05-29 17:43:08] [INFO ] Computed and/alt/rep : 721/2752/721 causal constraints (skipped 1031 transitions) in 164 ms.
[2025-05-29 17:43:12] [INFO ] Added : 178 causal constraints over 36 iterations in 4295 ms. Result :sat
Minimization took 1232 ms.
[2025-05-29 17:43:13] [INFO ] [Real]Absence check using 47 positive place invariants in 39 ms returned sat
[2025-05-29 17:43:13] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 45 ms returned sat
[2025-05-29 17:43:14] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2025-05-29 17:43:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:14] [INFO ] [Nat]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:43:14] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 28 ms returned sat
[2025-05-29 17:43:15] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2025-05-29 17:43:15] [INFO ] Computed and/alt/rep : 721/2752/721 causal constraints (skipped 1031 transitions) in 88 ms.
[2025-05-29 17:43:22] [INFO ] Added : 413 causal constraints over 83 iterations in 7128 ms. Result :sat
Minimization took 1413 ms.
[2025-05-29 17:43:24] [INFO ] [Real]Absence check using 47 positive place invariants in 24 ms returned sat
[2025-05-29 17:43:24] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 28 ms returned sat
[2025-05-29 17:43:24] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2025-05-29 17:43:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:24] [INFO ] [Nat]Absence check using 47 positive place invariants in 21 ms returned sat
[2025-05-29 17:43:24] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 27 ms returned sat
[2025-05-29 17:43:25] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2025-05-29 17:43:25] [INFO ] Computed and/alt/rep : 721/2752/721 causal constraints (skipped 1031 transitions) in 94 ms.
[2025-05-29 17:43:34] [INFO ] Added : 510 causal constraints over 102 iterations in 9158 ms. Result :sat
Minimization took 1257 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 1069 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1069/1069 places, 1790/1790 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 1069 transition count 1786
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1065 transition count 1786
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1064 transition count 1785
Applied a total of 10 rules in 74 ms. Remains 1064 /1069 variables (removed 5) and now considering 1785/1790 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1064/1069 places, 1785/1790 transitions.
// Phase 1: matrix 1785 rows 1064 cols
[2025-05-29 17:43:40] [INFO ] Computed 187 invariants in 18 ms
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 (10792 resets) in 3304 ms. (302 steps per ms)
BEST_FIRST walk for 5000005 steps (7693 resets) in 6762 ms. (739 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:43:50] [INFO ] Invariant cache hit.
[2025-05-29 17:43:50] [INFO ] [Real]Absence check using 47 positive place invariants in 16 ms returned sat
[2025-05-29 17:43:50] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 28 ms returned sat
[2025-05-29 17:43:51] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2025-05-29 17:43:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:51] [INFO ] [Nat]Absence check using 47 positive place invariants in 20 ms returned sat
[2025-05-29 17:43:51] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 27 ms returned sat
[2025-05-29 17:43:52] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2025-05-29 17:43:52] [INFO ] Computed and/alt/rep : 708/2668/708 causal constraints (skipped 1039 transitions) in 86 ms.
[2025-05-29 17:44:02] [INFO ] Added : 574 causal constraints over 115 iterations in 10191 ms. Result :sat
Minimization took 1596 ms.
[2025-05-29 17:44:04] [INFO ] [Real]Absence check using 47 positive place invariants in 16 ms returned sat
[2025-05-29 17:44:04] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 28 ms returned sat
[2025-05-29 17:44:04] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2025-05-29 17:44:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:04] [INFO ] [Nat]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:44:04] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 28 ms returned sat
[2025-05-29 17:44:05] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2025-05-29 17:44:05] [INFO ] Computed and/alt/rep : 708/2668/708 causal constraints (skipped 1039 transitions) in 87 ms.
[2025-05-29 17:44:15] [INFO ] Added : 562 causal constraints over 113 iterations in 10349 ms. Result :sat
Minimization took 1572 ms.
[2025-05-29 17:44:17] [INFO ] [Real]Absence check using 47 positive place invariants in 14 ms returned sat
[2025-05-29 17:44:17] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 27 ms returned sat
[2025-05-29 17:44:18] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2025-05-29 17:44:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:18] [INFO ] [Nat]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:44:18] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 28 ms returned sat
[2025-05-29 17:44:18] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2025-05-29 17:44:19] [INFO ] Computed and/alt/rep : 708/2668/708 causal constraints (skipped 1039 transitions) in 83 ms.
[2025-05-29 17:44:21] [INFO ] Added : 101 causal constraints over 21 iterations in 2434 ms. Result :sat
Minimization took 1500 ms.
[2025-05-29 17:44:23] [INFO ] [Real]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:44:23] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 30 ms returned sat
[2025-05-29 17:44:23] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2025-05-29 17:44:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:23] [INFO ] [Nat]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:44:23] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 26 ms returned sat
[2025-05-29 17:44:24] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2025-05-29 17:44:24] [INFO ] Deduced a trap composed of 112 places in 269 ms of which 13 ms to minimize.
[2025-05-29 17:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2025-05-29 17:44:24] [INFO ] Computed and/alt/rep : 708/2668/708 causal constraints (skipped 1039 transitions) in 94 ms.
[2025-05-29 17:44:34] [INFO ] Added : 557 causal constraints over 112 iterations in 9758 ms. Result :sat
Minimization took 1540 ms.
[2025-05-29 17:44:36] [INFO ] [Real]Absence check using 47 positive place invariants in 15 ms returned sat
[2025-05-29 17:44:36] [INFO ] [Real]Absence check using 47 positive and 140 generalized place invariants in 27 ms returned sat
[2025-05-29 17:44:36] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2025-05-29 17:44:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using 47 positive place invariants in 19 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using 47 positive and 140 generalized place invariants in 35 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2025-05-29 17:44:37] [INFO ] Computed and/alt/rep : 708/2668/708 causal constraints (skipped 1039 transitions) in 95 ms.
[2025-05-29 17:44:41] [INFO ] Added : 192 causal constraints over 39 iterations in 4111 ms. Result :sat
Minimization took 1416 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 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1785/1785 transitions.
Applied a total of 0 rules in 46 ms. Remains 1064 /1064 variables (removed 0) and now considering 1785/1785 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1064/1064 places, 1785/1785 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1785/1785 transitions.
Applied a total of 0 rules in 46 ms. Remains 1064 /1064 variables (removed 0) and now considering 1785/1785 (removed 0) transitions.
[2025-05-29 17:44:49] [INFO ] Invariant cache hit.
[2025-05-29 17:44:50] [INFO ] Implicit Places using invariants in 1009 ms returned [1, 18, 19, 22, 33, 50, 68, 145, 160, 161, 163, 180, 198, 267, 271, 272, 283, 284, 286, 303, 321, 390, 394, 395, 406, 407, 409, 426, 444, 513, 517, 518, 529, 530, 532, 549, 567, 642, 646, 647, 658, 660, 661, 663, 680, 698, 767, 771, 772, 783, 784, 786, 803, 821, 890, 894, 895, 898, 909, 910, 911, 929, 931, 935, 953, 954, 955, 956, 968, 974, 980, 986, 992, 998, 1004, 1010, 1016, 1022, 1028]
[2025-05-29 17:44:50] [INFO ] Actually due to overlaps returned [929, 911, 50, 180, 303, 426, 532, 549, 680, 803, 935, 33, 163, 286, 409, 663, 786, 160, 283, 406, 529, 660, 783, 909, 953, 161, 284, 407, 530, 661, 784, 910, 931, 954, 1, 18, 271, 272, 394, 395, 517, 518, 646, 647, 771, 772, 894, 895, 68, 198, 321, 444, 567, 658, 698, 821, 955, 998, 1016, 1028, 19, 22, 145, 898, 956, 968, 974, 980, 986, 992, 1004, 1010, 1022]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1012 ms to find 73 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 991/1064 places, 1785/1785 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 985 transition count 1644
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 294 place count 844 transition count 1638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 843 transition count 1638
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 295 place count 843 transition count 1603
Deduced a syphon composed of 35 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 366 place count 807 transition count 1603
Discarding 5 places :
Implicit places reduction removed 5 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 13 rules applied. Total rules applied 379 place count 802 transition count 1595
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 387 place count 794 transition count 1595
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 402 place count 779 transition count 1580
Iterating global reduction 5 with 15 rules applied. Total rules applied 417 place count 779 transition count 1580
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 420 place count 779 transition count 1577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 420 place count 779 transition count 1576
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 422 place count 778 transition count 1576
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 425 place count 775 transition count 1570
Iterating global reduction 6 with 3 rules applied. Total rules applied 428 place count 775 transition count 1570
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 429 place count 774 transition count 1569
Iterating global reduction 6 with 1 rules applied. Total rules applied 430 place count 774 transition count 1569
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 431 place count 773 transition count 1567
Iterating global reduction 6 with 1 rules applied. Total rules applied 432 place count 773 transition count 1567
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 542 place count 718 transition count 1512
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 548 place count 712 transition count 1506
Iterating global reduction 6 with 6 rules applied. Total rules applied 554 place count 712 transition count 1506
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 560 place count 712 transition count 1500
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 564 place count 710 transition count 1501
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 565 place count 710 transition count 1500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 566 place count 709 transition count 1500
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 583 place count 709 transition count 1483
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 601 place count 691 transition count 1483
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 603 place count 691 transition count 1481
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 624 place count 691 transition count 1481
Applied a total of 624 rules in 290 ms. Remains 691 /991 variables (removed 300) and now considering 1481/1785 (removed 304) transitions.
// Phase 1: matrix 1481 rows 691 cols
[2025-05-29 17:44:50] [INFO ] Computed 101 invariants in 12 ms
[2025-05-29 17:44:51] [INFO ] Implicit Places using invariants in 413 ms returned [92, 98, 101, 103, 106, 113, 114, 168, 185, 191, 194, 196, 201, 202, 254, 271, 277, 280, 282, 287, 288, 340, 357, 363, 366, 368, 373, 374, 426, 443, 449, 452, 454, 459, 460, 513, 530, 536, 539, 541, 546, 547, 599, 616, 622, 625, 627]
[2025-05-29 17:44:51] [INFO ] Actually due to overlaps returned [113, 201, 287, 373, 459, 546, 114, 202, 288, 374, 460, 547, 92, 98, 103, 185, 191, 196, 271, 277, 282, 357, 363, 368, 443, 449, 454, 530, 536, 541, 616, 622, 627, 106, 168, 254, 340, 426, 513, 599]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 416 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 651/1064 places, 1481/1785 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 622 transition count 1452
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 622 transition count 1452
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 615 transition count 1445
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 615 transition count 1445
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 98 place count 602 transition count 1432
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 119 place count 602 transition count 1411
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 140 place count 581 transition count 1411
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 146 place count 581 transition count 1405
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 152 place count 575 transition count 1405
Applied a total of 152 rules in 104 ms. Remains 575 /651 variables (removed 76) and now considering 1405/1481 (removed 76) transitions.
// Phase 1: matrix 1405 rows 575 cols
[2025-05-29 17:44:51] [INFO ] Computed 61 invariants in 11 ms
[2025-05-29 17:44:51] [INFO ] Implicit Places using invariants in 378 ms returned []
[2025-05-29 17:44:51] [INFO ] Invariant cache hit.
[2025-05-29 17:44:52] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 575/1064 places, 1405/1785 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3368 ms. Remains : 575/1064 places, 1405/1785 transitions.
[2025-05-29 17:44:52] [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 (17401 resets) in 2215 ms. (451 steps per ms)
BEST_FIRST walk for 5000005 steps (16221 resets) in 3994 ms. (1251 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:44:58] [INFO ] Invariant cache hit.
[2025-05-29 17:44:59] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:59] [INFO ] [Real]Absence check using 15 positive and 46 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:59] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-05-29 17:44:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:59] [INFO ] [Nat]Absence check using 15 positive and 46 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:59] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2025-05-29 17:45:00] [INFO ] Computed and/alt/rep : 322/1426/322 causal constraints (skipped 1046 transitions) in 74 ms.
[2025-05-29 17:45:00] [INFO ] Added : 47 causal constraints over 10 iterations in 842 ms. Result :sat
Minimization took 669 ms.
[2025-05-29 17:45:01] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:01] [INFO ] [Real]Absence check using 15 positive and 46 generalized place invariants in 11 ms returned sat
[2025-05-29 17:45:02] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-05-29 17:45:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:02] [INFO ] [Nat]Absence check using 15 positive and 46 generalized place invariants in 13 ms returned sat
[2025-05-29 17:45:02] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2025-05-29 17:45:02] [INFO ] Computed and/alt/rep : 322/1426/322 causal constraints (skipped 1046 transitions) in 77 ms.
[2025-05-29 17:45:03] [INFO ] Added : 41 causal constraints over 9 iterations in 741 ms. Result :sat
Minimization took 669 ms.
[2025-05-29 17:45:04] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:04] [INFO ] [Real]Absence check using 15 positive and 46 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:04] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-05-29 17:45:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:04] [INFO ] [Nat]Absence check using 15 positive and 46 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:05] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-05-29 17:45:05] [INFO ] Computed and/alt/rep : 322/1426/322 causal constraints (skipped 1046 transitions) in 68 ms.
[2025-05-29 17:45:06] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2025-05-29 17:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-05-29 17:45:06] [INFO ] Added : 76 causal constraints over 16 iterations in 1387 ms. Result :sat
Minimization took 561 ms.
[2025-05-29 17:45:07] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:07] [INFO ] [Real]Absence check using 15 positive and 46 generalized place invariants in 13 ms returned sat
[2025-05-29 17:45:07] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2025-05-29 17:45:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:07] [INFO ] [Nat]Absence check using 15 positive and 46 generalized place invariants in 11 ms returned sat
[2025-05-29 17:45:08] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2025-05-29 17:45:08] [INFO ] Computed and/alt/rep : 322/1426/322 causal constraints (skipped 1046 transitions) in 83 ms.
[2025-05-29 17:45:08] [INFO ] Added : 20 causal constraints over 4 iterations in 433 ms. Result :sat
Minimization took 550 ms.
[2025-05-29 17:45:09] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:09] [INFO ] [Real]Absence check using 15 positive and 46 generalized place invariants in 11 ms returned sat
[2025-05-29 17:45:09] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2025-05-29 17:45:09] [INFO ] Computed and/alt/rep : 322/1426/322 causal constraints (skipped 1046 transitions) in 74 ms.
[2025-05-29 17:45:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:09] [INFO ] [Nat]Absence check using 15 positive and 46 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2025-05-29 17:45:10] [INFO ] Computed and/alt/rep : 322/1426/322 causal constraints (skipped 1046 transitions) in 87 ms.
[2025-05-29 17:45:10] [INFO ] Added : 6 causal constraints over 2 iterations in 286 ms. Result :sat
Minimization took 535 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ASLink-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 1405/1405 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 575 transition count 1403
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 572 transition count 1403
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 572 transition count 1401
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 570 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 569 transition count 1400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 569 transition count 1399
Applied a total of 12 rules in 41 ms. Remains 569 /575 variables (removed 6) and now considering 1399/1405 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 569/575 places, 1399/1405 transitions.
// Phase 1: matrix 1399 rows 569 cols
[2025-05-29 17:45:12] [INFO ] Computed 60 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (17353 resets) in 2490 ms. (401 steps per ms)
BEST_FIRST walk for 2000002 steps (6539 resets) in 1726 ms. (1158 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:45:16] [INFO ] Invariant cache hit.
[2025-05-29 17:45:16] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:45:16] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:17] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-05-29 17:45:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:45:17] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 11 ms returned sat
[2025-05-29 17:45:17] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-05-29 17:45:17] [INFO ] Computed and/alt/rep : 323/1474/323 causal constraints (skipped 1039 transitions) in 66 ms.
[2025-05-29 17:45:18] [INFO ] Added : 41 causal constraints over 9 iterations in 860 ms. Result :sat
Minimization took 1073 ms.
[2025-05-29 17:45:19] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:45:19] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:20] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2025-05-29 17:45:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:45:20] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 11 ms returned sat
[2025-05-29 17:45:20] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2025-05-29 17:45:20] [INFO ] Computed and/alt/rep : 323/1474/323 causal constraints (skipped 1039 transitions) in 69 ms.
[2025-05-29 17:45:21] [INFO ] Added : 54 causal constraints over 11 iterations in 749 ms. Result :sat
Minimization took 1109 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 1399/1399 transitions.
Applied a total of 0 rules in 18 ms. Remains 569 /569 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 569/569 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 1399/1399 transitions.
Applied a total of 0 rules in 18 ms. Remains 569 /569 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2025-05-29 17:45:22] [INFO ] Invariant cache hit.
[2025-05-29 17:45:23] [INFO ] Implicit Places using invariants in 409 ms returned [72, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 417 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 567/569 places, 1399/1399 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 565 transition count 1397
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 565 transition count 1396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 564 transition count 1396
Applied a total of 6 rules in 96 ms. Remains 564 /567 variables (removed 3) and now considering 1396/1399 (removed 3) transitions.
// Phase 1: matrix 1396 rows 564 cols
[2025-05-29 17:45:23] [INFO ] Computed 58 invariants in 15 ms
[2025-05-29 17:45:23] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-05-29 17:45:23] [INFO ] Invariant cache hit.
[2025-05-29 17:45:24] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 564/569 places, 1396/1399 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2057 ms. Remains : 564/569 places, 1396/1399 transitions.
[2025-05-29 17:45:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (17299 resets) in 2148 ms. (465 steps per ms)
BEST_FIRST walk for 2000001 steps (6485 resets) in 1527 ms. (1308 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:45:28] [INFO ] Invariant cache hit.
[2025-05-29 17:45:28] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:28] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 11 ms returned sat
[2025-05-29 17:45:29] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2025-05-29 17:45:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:29] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:29] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2025-05-29 17:45:29] [INFO ] Computed and/alt/rep : 313/1398/313 causal constraints (skipped 1046 transitions) in 66 ms.
[2025-05-29 17:45:30] [INFO ] Added : 19 causal constraints over 4 iterations in 389 ms. Result :sat
Minimization took 937 ms.
[2025-05-29 17:45:31] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:31] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:31] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2025-05-29 17:45:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:45:31] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 11 ms returned sat
[2025-05-29 17:45:31] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2025-05-29 17:45:32] [INFO ] Computed and/alt/rep : 313/1398/313 causal constraints (skipped 1046 transitions) in 68 ms.
[2025-05-29 17:45:32] [INFO ] Added : 19 causal constraints over 4 iterations in 382 ms. Result :sat
Minimization took 747 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 1396/1396 transitions.
Applied a total of 0 rules in 16 ms. Remains 564 /564 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 564/564 places, 1396/1396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 1396/1396 transitions.
Applied a total of 0 rules in 17 ms. Remains 564 /564 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
[2025-05-29 17:45:33] [INFO ] Invariant cache hit.
[2025-05-29 17:45:34] [INFO ] Implicit Places using invariants in 461 ms returned []
[2025-05-29 17:45:34] [INFO ] Invariant cache hit.
[2025-05-29 17:45:35] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
[2025-05-29 17:45:35] [INFO ] Redundant transitions in 140 ms returned []
Running 1359 sub problems to find dead transitions.
[2025-05-29 17:45:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/563 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/1960 variables, and 54 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 43/44 constraints, State Equation: 0/564 constraints, PredecessorRefiner: 1359/1359 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/563 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1359 unsolved
At refinement iteration 3 (OVERLAPS) 1/564 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1359 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/1960 variables, and 58 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/564 constraints, PredecessorRefiner: 0/1359 constraints, Known Traps: 0/0 constraints]
After SMT, in 61206ms problems are : Problem set: 0 solved, 1359 unsolved
Search for dead transitions found 0 dead transitions in 61249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63012 ms. Remains : 564/564 places, 1396/1396 transitions.
RANDOM walk for 40000 steps (684 resets) in 1284 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (129 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (129 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (114 resets) in 406 ms. (98 steps per ms) remains 4/4 properties
[2025-05-29 17:46:37] [INFO ] Flatten gal took : 427 ms
BEST_FIRST walk for 40002 steps (129 resets) in 216 ms. (184 steps per ms) remains 4/4 properties
[2025-05-29 17:46:37] [INFO ] Flatten gal took : 126 ms
[2025-05-29 17:46:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12658500927329881421.gal : 38 ms
[2025-05-29 17:46:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17986342172558160855.prop : 1 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/ReachabilityCardinality12658500927329881421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17986342172558160855.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 ...330
Loading property file /tmp/ReachabilityCardinality17986342172558160855.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2448 after 136384
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :136384 after 7.9664e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :7.9664e+06 after 8.5588e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :8.5588e+06 after 8.59591e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8.59591e+06 after 8.72318e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :8.72318e+06 after 2.39176e+08
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.39176e+08 after 7.38395e+09
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Interrupted probabilistic random walk after 199401 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 4
Probabilistic random walk after 199401 steps, saw 103369 distinct states, run finished after 3004 ms. (steps per millisecond=66 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-07b-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-07b-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 344306 ms.
BK_STOP 1748540800606
--------------------
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-07b"
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-07b, 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-174853743000049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07b.tgz
mv ASLink-PT-07b 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 '
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 ;