fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r013-tall-174853743000045
Last Updated
June 24, 2025

About the Execution of 2024-gold for ASLink-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15690.700 416652.00 482473.00 1318.20 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-174853743000045.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-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 795K 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-05b-UpperBounds-00
FORMULA_NAME ASLink-PT-05b-UpperBounds-01
FORMULA_NAME ASLink-PT-05b-UpperBounds-02
FORMULA_NAME ASLink-PT-05b-UpperBounds-03
FORMULA_NAME ASLink-PT-05b-UpperBounds-04
FORMULA_NAME ASLink-PT-05b-UpperBounds-05
FORMULA_NAME ASLink-PT-05b-UpperBounds-06
FORMULA_NAME ASLink-PT-05b-UpperBounds-07
FORMULA_NAME ASLink-PT-05b-UpperBounds-08
FORMULA_NAME ASLink-PT-05b-UpperBounds-09
FORMULA_NAME ASLink-PT-05b-UpperBounds-10
FORMULA_NAME ASLink-PT-05b-UpperBounds-11
FORMULA_NAME ASLink-PT-05b-UpperBounds-12
FORMULA_NAME ASLink-PT-05b-UpperBounds-13
FORMULA_NAME ASLink-PT-05b-UpperBounds-14
FORMULA_NAME ASLink-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540261153

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37:42] [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:37:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:42] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-05-29 17:37:42] [INFO ] Transformed 2430 places.
[2025-05-29 17:37:42] [INFO ] Transformed 3040 transitions.
[2025-05-29 17:37:42] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:42] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3040 rows 2430 cols
[2025-05-29 17:37:43] [INFO ] Computed 238 invariants in 216 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 (26 resets) in 68 ms. (144 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (26 resets) in 151 ms. (657 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:37:43] [INFO ] Invariant cache hit.
[2025-05-29 17:37:44] [INFO ] [Real]Absence check using 56 positive place invariants in 74 ms returned sat
[2025-05-29 17:37:44] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 89 ms returned sat
[2025-05-29 17:37:45] [INFO ] [Real]Absence check using state equation in 1739 ms returned sat
[2025-05-29 17:37:47] [INFO ] Deduced a trap composed of 112 places in 1100 ms of which 97 ms to minimize.
[2025-05-29 17:37:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:47] [INFO ] [Nat]Absence check using 56 positive place invariants in 59 ms returned sat
[2025-05-29 17:37:47] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 57 ms returned sat
[2025-05-29 17:37:50] [INFO ] [Nat]Absence check using state equation in 2519 ms returned sat
[2025-05-29 17:37:51] [INFO ] Deduced a trap composed of 66 places in 813 ms of which 12 ms to minimize.
[2025-05-29 17:37:52] [INFO ] Deduced a trap composed of 68 places in 802 ms of which 11 ms to minimize.
[2025-05-29 17:37:52] [INFO ] Deduced a trap composed of 81 places in 531 ms of which 8 ms to minimize.
[2025-05-29 17:37: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:37:53] [INFO ] [Real]Absence check using 56 positive place invariants in 54 ms returned sat
[2025-05-29 17:37:53] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 76 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Real]Absence check using state equation in 1282 ms returned sat
[2025-05-29 17:37:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using 56 positive place invariants in 65 ms returned sat
[2025-05-29 17:37:55] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 63 ms returned sat
[2025-05-29 17:37:56] [INFO ] [Nat]Absence check using state equation in 1375 ms returned sat
[2025-05-29 17:37:57] [INFO ] Deduced a trap composed of 85 places in 1034 ms of which 14 ms to minimize.
[2025-05-29 17:37:58] [INFO ] Deduced a trap composed of 91 places in 1083 ms of which 13 ms to minimize.
[2025-05-29 17:37:59] [INFO ] Deduced a trap composed of 83 places in 1075 ms of which 14 ms to minimize.
[2025-05-29 17:37: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 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:38:00] [INFO ] [Real]Absence check using 56 positive place invariants in 52 ms returned sat
[2025-05-29 17:38:00] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 57 ms returned sat
[2025-05-29 17:38:01] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2025-05-29 17:38:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 56 positive place invariants in 51 ms returned sat
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 64 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Nat]Absence check using state equation in 2270 ms returned sat
[2025-05-29 17:38:04] [INFO ] Deduced a trap composed of 93 places in 477 ms of which 7 ms to minimize.
[2025-05-29 17:38:05] [INFO ] Deduced a trap composed of 65 places in 474 ms of which 7 ms to minimize.
[2025-05-29 17:38:05] [INFO ] Deduced a trap composed of 93 places in 488 ms of which 7 ms to minimize.
[2025-05-29 17:38:06] [INFO ] Deduced a trap composed of 123 places in 479 ms of which 7 ms to minimize.
[2025-05-29 17:38:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
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:38:06] [INFO ] [Real]Absence check using 56 positive place invariants in 53 ms returned sat
[2025-05-29 17:38:07] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 70 ms returned sat
[2025-05-29 17:38:08] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2025-05-29 17:38:09] [INFO ] Deduced a trap composed of 43 places in 590 ms of which 9 ms to minimize.
[2025-05-29 17:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:09] [INFO ] [Nat]Absence check using 56 positive place invariants in 52 ms returned sat
[2025-05-29 17:38:09] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 64 ms returned sat
[2025-05-29 17:38:11] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2025-05-29 17:38:12] [INFO ] Deduced a trap composed of 51 places in 887 ms of which 12 ms to minimize.
[2025-05-29 17:38:13] [INFO ] Deduced a trap composed of 57 places in 895 ms of which 12 ms to minimize.
[2025-05-29 17:38:14] [INFO ] Deduced a trap composed of 108 places in 878 ms of which 11 ms to minimize.
[2025-05-29 17:38: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 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:38:14] [INFO ] [Real]Absence check using 56 positive place invariants in 51 ms returned sat
[2025-05-29 17:38:14] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 67 ms returned sat
[2025-05-29 17:38:16] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2025-05-29 17:38:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:16] [INFO ] [Nat]Absence check using 56 positive place invariants in 52 ms returned sat
[2025-05-29 17:38:16] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 63 ms returned sat
[2025-05-29 17:38:19] [INFO ] [Nat]Absence check using state equation in 2517 ms returned unknown
[2025-05-29 17:38:19] [INFO ] [Real]Absence check using 56 positive place invariants in 49 ms returned sat
[2025-05-29 17:38:19] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 62 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2025-05-29 17:38:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:21] [INFO ] [Nat]Absence check using 56 positive place invariants in 53 ms returned sat
[2025-05-29 17:38:21] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 66 ms returned sat
[2025-05-29 17:38:22] [INFO ] [Nat]Absence check using state equation in 1276 ms returned sat
[2025-05-29 17:38:23] [INFO ] Computed and/alt/rep : 2552/5600/2552 causal constraints (skipped 487 transitions) in 171 ms.
[2025-05-29 17:38:23] [INFO ] Added : 10 causal constraints over 2 iterations in 927 ms. Result :sat
Minimization took 566 ms.
[2025-05-29 17:38:24] [INFO ] [Real]Absence check using 56 positive place invariants in 51 ms returned sat
[2025-05-29 17:38:24] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 58 ms returned sat
[2025-05-29 17:38:26] [INFO ] [Real]Absence check using state equation in 1688 ms returned sat
[2025-05-29 17:38:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:26] [INFO ] [Nat]Absence check using 56 positive place invariants in 51 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 59 ms returned sat
[2025-05-29 17:38:28] [INFO ] [Nat]Absence check using state equation in 1352 ms returned sat
[2025-05-29 17:38:29] [INFO ] Deduced a trap composed of 61 places in 986 ms of which 13 ms to minimize.
[2025-05-29 17:38:30] [INFO ] Deduced a trap composed of 124 places in 909 ms of which 11 ms to minimize.
[2025-05-29 17:38:31] [INFO ] Deduced a trap composed of 145 places in 904 ms of which 12 ms to minimize.
[2025-05-29 17:38:32] [INFO ] Deduced a trap composed of 111 places in 864 ms of which 10 ms to minimize.
[2025-05-29 17:38:32] [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.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:38:32] [INFO ] [Real]Absence check using 56 positive place invariants in 51 ms returned sat
[2025-05-29 17:38:32] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 64 ms returned sat
[2025-05-29 17:38:33] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2025-05-29 17:38:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:34] [INFO ] [Nat]Absence check using 56 positive place invariants in 60 ms returned sat
[2025-05-29 17:38:34] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 63 ms returned sat
[2025-05-29 17:38:35] [INFO ] [Nat]Absence check using state equation in 1444 ms returned sat
[2025-05-29 17:38:36] [INFO ] Deduced a trap composed of 39 places in 1078 ms of which 13 ms to minimize.
[2025-05-29 17:38:38] [INFO ] Deduced a trap composed of 20 places in 989 ms of which 13 ms to minimize.
[2025-05-29 17:38:39] [INFO ] Deduced a trap composed of 235 places in 1010 ms of which 14 ms to minimize.
[2025-05-29 17:38:39] [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 7
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:38:39] [INFO ] [Real]Absence check using 56 positive place invariants in 52 ms returned sat
[2025-05-29 17:38:39] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 68 ms returned sat
[2025-05-29 17:38:40] [INFO ] [Real]Absence check using state equation in 1347 ms returned sat
[2025-05-29 17:38:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:41] [INFO ] [Nat]Absence check using 56 positive place invariants in 52 ms returned sat
[2025-05-29 17:38:41] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 75 ms returned sat
[2025-05-29 17:38:42] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2025-05-29 17:38:43] [INFO ] Deduced a trap composed of 74 places in 573 ms of which 8 ms to minimize.
[2025-05-29 17:38:43] [INFO ] Deduced a trap composed of 58 places in 584 ms of which 8 ms to minimize.
[2025-05-29 17:38:44] [INFO ] Deduced a trap composed of 57 places in 556 ms of which 8 ms to minimize.
[2025-05-29 17:38:45] [INFO ] Deduced a trap composed of 76 places in 561 ms of which 7 ms to minimize.
[2025-05-29 17:38:45] [INFO ] Deduced a trap composed of 69 places in 560 ms of which 8 ms to minimize.
[2025-05-29 17:38:46] [INFO ] Deduced a trap composed of 100 places in 522 ms of which 8 ms to minimize.
[2025-05-29 17:38:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:38:46] [INFO ] [Real]Absence check using 56 positive place invariants in 52 ms returned sat
[2025-05-29 17:38:46] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 64 ms returned sat
[2025-05-29 17:38:48] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2025-05-29 17:38:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:48] [INFO ] [Nat]Absence check using 56 positive place invariants in 51 ms returned sat
[2025-05-29 17:38:48] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 61 ms returned sat
[2025-05-29 17:38:50] [INFO ] [Nat]Absence check using state equation in 1662 ms returned sat
[2025-05-29 17:38:51] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 9 ms to minimize.
[2025-05-29 17:38:51] [INFO ] Deduced a trap composed of 63 places in 460 ms of which 7 ms to minimize.
[2025-05-29 17:38:52] [INFO ] Deduced a trap composed of 110 places in 374 ms of which 6 ms to minimize.
[2025-05-29 17:38:52] [INFO ] Deduced a trap composed of 121 places in 386 ms of which 6 ms to minimize.
[2025-05-29 17:38:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2163 ms
[2025-05-29 17:38:52] [INFO ] Computed and/alt/rep : 2552/5600/2552 causal constraints (skipped 487 transitions) in 159 ms.
[2025-05-29 17:38:53] [INFO ] Added : 15 causal constraints over 3 iterations in 754 ms. Result :unknown
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 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2430 transition count 2483
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 583 rules applied. Total rules applied 1140 place count 1873 transition count 2457
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 1150 place count 1866 transition count 2454
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1153 place count 1863 transition count 2454
Performed 556 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 556 Pre rules applied. Total rules applied 1153 place count 1863 transition count 1898
Deduced a syphon composed of 556 places in 4 ms
Ensure Unique test removed 52 places
Reduce places removed 608 places and 0 transitions.
Iterating global reduction 4 with 1164 rules applied. Total rules applied 2317 place count 1255 transition count 1898
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 41 rules applied. Total rules applied 2358 place count 1248 transition count 1864
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 35 rules applied. Total rules applied 2393 place count 1214 transition count 1863
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2394 place count 1213 transition count 1863
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2394 place count 1213 transition count 1843
Deduced a syphon composed of 20 places in 9 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 2453 place count 1174 transition count 1843
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2453 place count 1174 transition count 1824
Deduced a syphon composed of 19 places in 8 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2491 place count 1155 transition count 1824
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2568 place count 1078 transition count 1747
Iterating global reduction 7 with 77 rules applied. Total rules applied 2645 place count 1078 transition count 1747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2646 place count 1078 transition count 1746
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 26 Pre rules applied. Total rules applied 2646 place count 1078 transition count 1720
Deduced a syphon composed of 26 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 53 rules applied. Total rules applied 2699 place count 1051 transition count 1720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2699 place count 1051 transition count 1719
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 8 with 3 rules applied. Total rules applied 2702 place count 1049 transition count 1719
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2707 place count 1044 transition count 1686
Iterating global reduction 8 with 5 rules applied. Total rules applied 2712 place count 1044 transition count 1686
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 2712 place count 1044 transition count 1682
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2720 place count 1040 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2721 place count 1039 transition count 1674
Iterating global reduction 8 with 1 rules applied. Total rules applied 2722 place count 1039 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2723 place count 1038 transition count 1666
Iterating global reduction 8 with 1 rules applied. Total rules applied 2724 place count 1038 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2725 place count 1037 transition count 1658
Iterating global reduction 8 with 1 rules applied. Total rules applied 2726 place count 1037 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2727 place count 1036 transition count 1650
Iterating global reduction 8 with 1 rules applied. Total rules applied 2728 place count 1036 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2729 place count 1035 transition count 1642
Iterating global reduction 8 with 1 rules applied. Total rules applied 2730 place count 1035 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2731 place count 1034 transition count 1634
Iterating global reduction 8 with 1 rules applied. Total rules applied 2732 place count 1034 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2733 place count 1033 transition count 1626
Iterating global reduction 8 with 1 rules applied. Total rules applied 2734 place count 1033 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2735 place count 1032 transition count 1618
Iterating global reduction 8 with 1 rules applied. Total rules applied 2736 place count 1032 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2737 place count 1031 transition count 1610
Iterating global reduction 8 with 1 rules applied. Total rules applied 2738 place count 1031 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2739 place count 1030 transition count 1602
Iterating global reduction 8 with 1 rules applied. Total rules applied 2740 place count 1030 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2741 place count 1029 transition count 1594
Iterating global reduction 8 with 1 rules applied. Total rules applied 2742 place count 1029 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2743 place count 1028 transition count 1586
Iterating global reduction 8 with 1 rules applied. Total rules applied 2744 place count 1028 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2745 place count 1027 transition count 1578
Iterating global reduction 8 with 1 rules applied. Total rules applied 2746 place count 1027 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2747 place count 1026 transition count 1570
Iterating global reduction 8 with 1 rules applied. Total rules applied 2748 place count 1026 transition count 1570
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2749 place count 1025 transition count 1562
Iterating global reduction 8 with 1 rules applied. Total rules applied 2750 place count 1025 transition count 1562
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2751 place count 1024 transition count 1554
Iterating global reduction 8 with 1 rules applied. Total rules applied 2752 place count 1024 transition count 1554
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 2 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 8 with 274 rules applied. Total rules applied 3026 place count 887 transition count 1417
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3027 place count 886 transition count 1416
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 3029 place count 885 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3030 place count 884 transition count 1415
Iterating global reduction 8 with 1 rules applied. Total rules applied 3031 place count 884 transition count 1415
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 8 with 2 rules applied. Total rules applied 3033 place count 884 transition count 1413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3034 place count 883 transition count 1413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3036 place count 882 transition count 1422
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3042 place count 882 transition count 1416
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3048 place count 876 transition count 1416
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3052 place count 876 transition count 1412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3056 place count 872 transition count 1412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3057 place count 871 transition count 1411
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 12 with 13 rules applied. Total rules applied 3070 place count 862 transition count 1407
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 3075 place count 858 transition count 1406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3076 place count 857 transition count 1406
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 13 Pre rules applied. Total rules applied 3076 place count 857 transition count 1393
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 15 with 26 rules applied. Total rules applied 3102 place count 844 transition count 1393
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 15 with 4 rules applied. Total rules applied 3106 place count 840 transition count 1393
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 16 with 16 rules applied. Total rules applied 3122 place count 832 transition count 1385
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3126 place count 828 transition count 1381
Iterating global reduction 16 with 4 rules applied. Total rules applied 3130 place count 828 transition count 1381
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 3134 place count 828 transition count 1377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3138 place count 824 transition count 1377
Applied a total of 3138 rules in 1534 ms. Remains 824 /2430 variables (removed 1606) and now considering 1377/3040 (removed 1663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1543 ms. Remains : 824/2430 places, 1377/3040 transitions.
// Phase 1: matrix 1377 rows 824 cols
[2025-05-29 17:38:55] [INFO ] Computed 144 invariants in 57 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 (12157 resets) in 2503 ms. (399 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000003 steps (16434 resets) in 7861 ms. (890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:39:06] [INFO ] Invariant cache hit.
[2025-05-29 17:39:06] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2025-05-29 17:39:06] [INFO ] [Real]Absence check using 37 positive and 107 generalized place invariants in 23 ms returned sat
[2025-05-29 17:39:06] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-05-29 17:39:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:06] [INFO ] [Nat]Absence check using 37 positive and 107 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:07] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2025-05-29 17:39:07] [INFO ] Computed and/alt/rep : 564/2158/564 causal constraints (skipped 783 transitions) in 71 ms.
[2025-05-29 17:39:12] [INFO ] Added : 392 causal constraints over 79 iterations in 5641 ms. Result :sat
Minimization took 774 ms.
[2025-05-29 17:39:13] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:13] [INFO ] [Real]Absence check using 37 positive and 107 generalized place invariants in 20 ms returned sat
[2025-05-29 17:39:14] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-05-29 17:39:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:14] [INFO ] [Nat]Absence check using 37 positive and 107 generalized place invariants in 19 ms returned sat
[2025-05-29 17:39:14] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2025-05-29 17:39:14] [INFO ] Computed and/alt/rep : 564/2158/564 causal constraints (skipped 783 transitions) in 67 ms.
[2025-05-29 17:39:17] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2025-05-29 17:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2025-05-29 17:39:17] [INFO ] Added : 174 causal constraints over 36 iterations in 3092 ms. Result :sat
Minimization took 742 ms.
[2025-05-29 17:39:18] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:18] [INFO ] [Real]Absence check using 37 positive and 107 generalized place invariants in 23 ms returned sat
[2025-05-29 17:39:19] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2025-05-29 17:39:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2025-05-29 17:39:19] [INFO ] [Nat]Absence check using 37 positive and 107 generalized place invariants in 20 ms returned sat
[2025-05-29 17:39:19] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2025-05-29 17:39:19] [INFO ] Computed and/alt/rep : 564/2158/564 causal constraints (skipped 783 transitions) in 68 ms.
[2025-05-29 17:39:25] [INFO ] Added : 381 causal constraints over 77 iterations in 5416 ms. Result :sat
Minimization took 839 ms.
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using 37 positive and 107 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2025-05-29 17:39:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Nat]Absence check using 37 positive and 107 generalized place invariants in 20 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-05-29 17:39:27] [INFO ] Computed and/alt/rep : 564/2158/564 causal constraints (skipped 783 transitions) in 75 ms.
[2025-05-29 17:39:33] [INFO ] Added : 466 causal constraints over 94 iterations in 6895 ms. Result :sat
Minimization took 883 ms.
[2025-05-29 17:39:34] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:34] [INFO ] [Real]Absence check using 37 positive and 107 generalized place invariants in 20 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2025-05-29 17:39:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using 37 positive and 107 generalized place invariants in 19 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2025-05-29 17:39:35] [INFO ] Computed and/alt/rep : 564/2158/564 causal constraints (skipped 783 transitions) in 67 ms.
[2025-05-29 17:39:41] [INFO ] Added : 386 causal constraints over 78 iterations in 5799 ms. Result :sat
Minimization took 922 ms.
[2025-05-29 17:39:42] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2025-05-29 17:39:42] [INFO ] [Real]Absence check using 37 positive and 107 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2025-05-29 17:39:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Nat]Absence check using 37 positive and 107 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2025-05-29 17:39:43] [INFO ] Computed and/alt/rep : 564/2158/564 causal constraints (skipped 783 transitions) in 67 ms.
[2025-05-29 17:39:47] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 4 ms to minimize.
[2025-05-29 17:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2025-05-29 17:39:47] [INFO ] Added : 176 causal constraints over 36 iterations in 3682 ms. Result :sat
Minimization took 859 ms.
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using 37 positive and 107 generalized place invariants in 20 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-05-29 17:39:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2025-05-29 17:39:49] [INFO ] [Nat]Absence check using 37 positive and 107 generalized place invariants in 20 ms returned sat
[2025-05-29 17:39:49] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-05-29 17:39:49] [INFO ] Computed and/alt/rep : 564/2158/564 causal constraints (skipped 783 transitions) in 70 ms.
[2025-05-29 17:39:55] [INFO ] Added : 421 causal constraints over 85 iterations in 5925 ms. Result :sat
Minimization took 872 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 824 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 824/824 places, 1377/1377 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 824 transition count 1376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 823 transition count 1376
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 823 transition count 1373
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 820 transition count 1373
Applied a total of 8 rules in 36 ms. Remains 820 /824 variables (removed 4) and now considering 1373/1377 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 820/824 places, 1373/1377 transitions.
// Phase 1: matrix 1373 rows 820 cols
[2025-05-29 17:39:59] [INFO ] Computed 144 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (12248 resets) in 2419 ms. (413 steps per ms)
BEST_FIRST walk for 7000005 steps (16439 resets) in 7940 ms. (881 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:40:09] [INFO ] Invariant cache hit.
[2025-05-29 17:40:10] [INFO ] [Real]Absence check using 38 positive place invariants in 21 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 21 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-05-29 17:40:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 20 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2025-05-29 17:40:11] [INFO ] Computed and/alt/rep : 545/2019/545 causal constraints (skipped 798 transitions) in 69 ms.
[2025-05-29 17:40:12] [INFO ] Added : 120 causal constraints over 24 iterations in 1719 ms. Result :sat
Minimization took 846 ms.
[2025-05-29 17:40:13] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:13] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 23 ms returned sat
[2025-05-29 17:40:14] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-05-29 17:40:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:14] [INFO ] [Nat]Absence check using 38 positive place invariants in 11 ms returned sat
[2025-05-29 17:40:14] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 19 ms returned sat
[2025-05-29 17:40:14] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2025-05-29 17:40:14] [INFO ] Deduced a trap composed of 118 places in 191 ms of which 3 ms to minimize.
[2025-05-29 17:40:15] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 3 ms to minimize.
[2025-05-29 17:40:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 577 ms
[2025-05-29 17:40:15] [INFO ] Computed and/alt/rep : 545/2019/545 causal constraints (skipped 798 transitions) in 76 ms.
[2025-05-29 17:40:20] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2025-05-29 17:40:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2025-05-29 17:40:20] [INFO ] Added : 356 causal constraints over 72 iterations in 5307 ms. Result :sat
Minimization took 874 ms.
[2025-05-29 17:40:21] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:21] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 20 ms returned sat
[2025-05-29 17:40:21] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-05-29 17:40:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:22] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:22] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 21 ms returned sat
[2025-05-29 17:40:22] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2025-05-29 17:40:22] [INFO ] Computed and/alt/rep : 545/2019/545 causal constraints (skipped 798 transitions) in 66 ms.
[2025-05-29 17:40:28] [INFO ] Added : 406 causal constraints over 82 iterations in 6223 ms. Result :sat
Minimization took 863 ms.
[2025-05-29 17:40:29] [INFO ] [Real]Absence check using 38 positive place invariants in 23 ms returned sat
[2025-05-29 17:40:29] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 20 ms returned sat
[2025-05-29 17:40:30] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-05-29 17:40:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:30] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:30] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:30] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2025-05-29 17:40:30] [INFO ] Computed and/alt/rep : 545/2019/545 causal constraints (skipped 798 transitions) in 67 ms.
[2025-05-29 17:40:33] [INFO ] Added : 150 causal constraints over 30 iterations in 2316 ms. Result :sat
Minimization took 882 ms.
[2025-05-29 17:40:34] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:34] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 21 ms returned sat
[2025-05-29 17:40:34] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-05-29 17:40:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:34] [INFO ] [Nat]Absence check using 38 positive place invariants in 14 ms returned sat
[2025-05-29 17:40:34] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 21 ms returned sat
[2025-05-29 17:40:34] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-05-29 17:40:35] [INFO ] Computed and/alt/rep : 545/2019/545 causal constraints (skipped 798 transitions) in 68 ms.
[2025-05-29 17:40:36] [INFO ] Added : 87 causal constraints over 18 iterations in 1359 ms. Result :sat
Minimization took 789 ms.
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 19 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2025-05-29 17:40:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:37] [INFO ] [Nat]Absence check using 38 positive place invariants in 11 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 20 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2025-05-29 17:40:38] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 3 ms to minimize.
[2025-05-29 17:40:38] [INFO ] Deduced a trap composed of 101 places in 206 ms of which 3 ms to minimize.
[2025-05-29 17:40:38] [INFO ] Deduced a trap composed of 96 places in 207 ms of which 3 ms to minimize.
[2025-05-29 17:40:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 782 ms
[2025-05-29 17:40:39] [INFO ] Computed and/alt/rep : 545/2019/545 causal constraints (skipped 798 transitions) in 66 ms.
[2025-05-29 17:40:45] [INFO ] Added : 436 causal constraints over 88 iterations in 6436 ms. Result :sat
Minimization took 901 ms.
[2025-05-29 17:40:46] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:46] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:46] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-05-29 17:40:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:46] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2025-05-29 17:40:46] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 20 ms returned sat
[2025-05-29 17:40:47] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2025-05-29 17:40:47] [INFO ] Computed and/alt/rep : 545/2019/545 causal constraints (skipped 798 transitions) in 80 ms.
[2025-05-29 17:40:54] [INFO ] Deduced a trap composed of 94 places in 309 ms of which 4 ms to minimize.
[2025-05-29 17:40:54] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 2 ms to minimize.
[2025-05-29 17:40:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 644 ms
[2025-05-29 17:40:54] [INFO ] Added : 435 causal constraints over 87 iterations in 7519 ms. Result :sat
Minimization took 1094 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 1373/1373 transitions.
Applied a total of 0 rules in 38 ms. Remains 820 /820 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 820/820 places, 1373/1373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 1373/1373 transitions.
Applied a total of 0 rules in 21 ms. Remains 820 /820 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
[2025-05-29 17:41:00] [INFO ] Invariant cache hit.
[2025-05-29 17:41:00] [INFO ] Implicit Places using invariants in 548 ms returned [1, 18, 19, 22, 51, 69, 140, 150, 165, 166, 168, 185, 203, 273, 277, 278, 289, 290, 292, 309, 399, 403, 404, 415, 416, 418, 435, 453, 523, 527, 528, 539, 540, 542, 559, 577, 646, 650, 651, 654, 665, 666, 667, 685, 687, 691, 709, 710, 711, 712, 724, 730, 736, 742, 748, 754, 760, 766, 772, 778, 784]
[2025-05-29 17:41:00] [INFO ] Actually due to overlaps returned [685, 667, 51, 185, 309, 435, 559, 691, 168, 292, 418, 542, 165, 289, 415, 539, 665, 709, 166, 290, 416, 540, 666, 687, 710, 1, 18, 277, 278, 403, 404, 527, 528, 650, 651, 69, 203, 453, 577, 711, 754, 772, 784, 19, 22, 140, 150, 654, 712, 724, 730, 736, 742, 748, 760, 766, 778]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 552 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 763/820 places, 1373/1373 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 759 transition count 1274
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 660 transition count 1268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 658 transition count 1268
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 210 place count 658 transition count 1241
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 265 place count 630 transition count 1241
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 277 place count 626 transition count 1233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 285 place count 618 transition count 1233
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 301 place count 602 transition count 1217
Iterating global reduction 5 with 16 rules applied. Total rules applied 317 place count 602 transition count 1217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 320 place count 602 transition count 1214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 320 place count 602 transition count 1213
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 322 place count 601 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 326 place count 597 transition count 1206
Iterating global reduction 6 with 4 rules applied. Total rules applied 330 place count 597 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 332 place count 595 transition count 1204
Iterating global reduction 6 with 2 rules applied. Total rules applied 334 place count 595 transition count 1204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 335 place count 595 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 336 place count 594 transition count 1201
Iterating global reduction 7 with 1 rules applied. Total rules applied 337 place count 594 transition count 1201
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 421 place count 552 transition count 1159
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 425 place count 548 transition count 1154
Iterating global reduction 7 with 4 rules applied. Total rules applied 429 place count 548 transition count 1154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 432 place count 548 transition count 1151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 436 place count 546 transition count 1152
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 437 place count 546 transition count 1151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 438 place count 545 transition count 1151
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 451 place count 545 transition count 1138
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 465 place count 531 transition count 1138
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 480 place count 531 transition count 1138
Applied a total of 480 rules in 241 ms. Remains 531 /763 variables (removed 232) and now considering 1138/1373 (removed 235) transitions.
// Phase 1: matrix 1138 rows 531 cols
[2025-05-29 17:41:00] [INFO ] Computed 77 invariants in 9 ms
[2025-05-29 17:41:01] [INFO ] Implicit Places using invariants in 464 ms returned [99, 105, 108, 110, 113, 120, 121, 175, 194, 200, 203, 205, 210, 211, 265, 283, 289, 292, 294, 299, 300, 352, 370, 376, 379, 381, 386, 387, 439, 456, 462, 465, 467]
[2025-05-29 17:41:01] [INFO ] Actually due to overlaps returned [120, 210, 299, 386, 121, 211, 300, 387, 99, 105, 110, 194, 200, 205, 283, 289, 294, 370, 376, 381, 456, 462, 467, 113, 175, 265, 352, 439]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 466 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 503/820 places, 1138/1373 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 482 transition count 1117
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 482 transition count 1117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 477 transition count 1112
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 477 transition count 1112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 68 place count 469 transition count 1104
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 469 transition count 1089
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 454 transition count 1089
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 454 transition count 1085
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 450 transition count 1085
Applied a total of 106 rules in 77 ms. Remains 450 /503 variables (removed 53) and now considering 1085/1138 (removed 53) transitions.
// Phase 1: matrix 1085 rows 450 cols
[2025-05-29 17:41:01] [INFO ] Computed 49 invariants in 8 ms
[2025-05-29 17:41:01] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-05-29 17:41:01] [INFO ] Invariant cache hit.
[2025-05-29 17:41:02] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 450/820 places, 1085/1373 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2560 ms. Remains : 450/820 places, 1085/1373 transitions.
[2025-05-29 17:41:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (18517 resets) in 1948 ms. (513 steps per ms)
BEST_FIRST walk for 7000006 steps (31381 resets) in 5460 ms. (1281 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:41:09] [INFO ] Invariant cache hit.
[2025-05-29 17:41:10] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:10] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:10] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2025-05-29 17:41:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:10] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:10] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2025-05-29 17:41:10] [INFO ] Computed and/alt/rep : 248/1108/248 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:10] [INFO ] Added : 14 causal constraints over 3 iterations in 268 ms. Result :sat
Minimization took 587 ms.
[2025-05-29 17:41:11] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:11] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:11] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-05-29 17:41:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:11] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 8 ms returned sat
[2025-05-29 17:41:12] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-05-29 17:41:12] [INFO ] Computed and/alt/rep : 248/1108/248 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:13] [INFO ] Added : 76 causal constraints over 16 iterations in 937 ms. Result :sat
Minimization took 599 ms.
[2025-05-29 17:41:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:13] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 8 ms returned sat
[2025-05-29 17:41:14] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-05-29 17:41:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:14] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:14] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-29 17:41:14] [INFO ] Computed and/alt/rep : 248/1108/248 causal constraints (skipped 808 transitions) in 50 ms.
[2025-05-29 17:41:15] [INFO ] Added : 54 causal constraints over 13 iterations in 717 ms. Result :sat
Minimization took 621 ms.
[2025-05-29 17:41:15] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:15] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 11 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2025-05-29 17:41:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 8 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-05-29 17:41:16] [INFO ] Computed and/alt/rep : 248/1108/248 causal constraints (skipped 808 transitions) in 53 ms.
[2025-05-29 17:41:17] [INFO ] Added : 61 causal constraints over 13 iterations in 745 ms. Result :sat
Minimization took 556 ms.
[2025-05-29 17:41:17] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:17] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 11 ms returned sat
[2025-05-29 17:41:18] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-05-29 17:41:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:18] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 8 ms returned sat
[2025-05-29 17:41:18] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2025-05-29 17:41:18] [INFO ] Computed and/alt/rep : 248/1108/248 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:18] [INFO ] Added : 8 causal constraints over 2 iterations in 217 ms. Result :sat
Minimization took 551 ms.
[2025-05-29 17:41:19] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:19] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:19] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2025-05-29 17:41:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:19] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:19] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2025-05-29 17:41:20] [INFO ] Computed and/alt/rep : 248/1108/248 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:20] [INFO ] Added : 15 causal constraints over 3 iterations in 333 ms. Result :sat
Minimization took 555 ms.
[2025-05-29 17:41:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:21] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 10 ms returned sat
[2025-05-29 17:41:21] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-05-29 17:41:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:21] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 11 ms returned sat
[2025-05-29 17:41:21] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2025-05-29 17:41:21] [INFO ] Computed and/alt/rep : 248/1108/248 causal constraints (skipped 808 transitions) in 54 ms.
[2025-05-29 17:41:22] [INFO ] Added : 34 causal constraints over 7 iterations in 501 ms. Result :sat
Minimization took 597 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 1085/1085 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 448 transition count 1083
Applied a total of 4 rules in 22 ms. Remains 448 /450 variables (removed 2) and now considering 1083/1085 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 448/450 places, 1083/1085 transitions.
// Phase 1: matrix 1083 rows 448 cols
[2025-05-29 17:41:26] [INFO ] Computed 49 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (18680 resets) in 1880 ms. (531 steps per ms)
BEST_FIRST walk for 6000006 steps (26885 resets) in 4601 ms. (1303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:41:32] [INFO ] Invariant cache hit.
[2025-05-29 17:41:32] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:32] [INFO ] [Real]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:32] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2025-05-29 17:41:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:33] [INFO ] [Nat]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:33] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-05-29 17:41:33] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:33] [INFO ] Added : 23 causal constraints over 5 iterations in 338 ms. Result :sat
Minimization took 564 ms.
[2025-05-29 17:41:34] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Real]Absence check using 12 positive and 37 generalized place invariants in 17 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2025-05-29 17:41:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-05-29 17:41:34] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 56 ms.
[2025-05-29 17:41:35] [INFO ] Added : 32 causal constraints over 7 iterations in 435 ms. Result :sat
Minimization took 630 ms.
[2025-05-29 17:41:36] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:36] [INFO ] [Real]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:36] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-05-29 17:41:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:36] [INFO ] [Nat]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:36] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2025-05-29 17:41:36] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:37] [INFO ] Added : 35 causal constraints over 7 iterations in 518 ms. Result :sat
Minimization took 859 ms.
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using 12 positive and 37 generalized place invariants in 10 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using state equation in 219 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 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Nat]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-05-29 17:41:38] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 53 ms.
[2025-05-29 17:41:39] [INFO ] Added : 18 causal constraints over 4 iterations in 299 ms. Result :sat
Minimization took 635 ms.
[2025-05-29 17:41:39] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:39] [INFO ] [Real]Absence check using 12 positive and 37 generalized place invariants in 10 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2025-05-29 17:41:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2025-05-29 17:41:40] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:40] [INFO ] Added : 28 causal constraints over 6 iterations in 415 ms. Result :sat
Minimization took 578 ms.
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2025-05-29 17:41:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using 12 positive and 37 generalized place invariants in 9 ms returned sat
[2025-05-29 17:41:42] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-05-29 17:41:42] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 52 ms.
[2025-05-29 17:41:42] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2025-05-29 17:41:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2025-05-29 17:41:42] [INFO ] Added : 37 causal constraints over 8 iterations in 765 ms. Result :sat
Minimization took 724 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1083/1083 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 448/448 places, 1083/1083 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1083/1083 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
[2025-05-29 17:41:53] [INFO ] Invariant cache hit.
[2025-05-29 17:41:54] [INFO ] Implicit Places using invariants in 272 ms returned [213]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 283 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/448 places, 1083/1083 transitions.
Applied a total of 0 rules in 14 ms. Remains 447 /447 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 309 ms. Remains : 447/448 places, 1083/1083 transitions.
// Phase 1: matrix 1083 rows 447 cols
[2025-05-29 17:41:54] [INFO ] Computed 48 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (18255 resets) in 1860 ms. (537 steps per ms)
BEST_FIRST walk for 6000006 steps (26791 resets) in 4512 ms. (1329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:42:00] [INFO ] Invariant cache hit.
[2025-05-29 17:42:00] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:00] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:42:00] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-05-29 17:42:00] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 64 ms.
[2025-05-29 17:42:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:01] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:42:01] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2025-05-29 17:42:01] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 50 ms.
[2025-05-29 17:42:01] [INFO ] Added : 10 causal constraints over 2 iterations in 207 ms. Result :sat
Minimization took 430 ms.
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-29 17:42:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:02] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 11 ms returned sat
[2025-05-29 17:42:02] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2025-05-29 17:42:02] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 53 ms.
[2025-05-29 17:42:03] [INFO ] Added : 18 causal constraints over 4 iterations in 341 ms. Result :sat
Minimization took 473 ms.
[2025-05-29 17:42:03] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:42:03] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:42:03] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-05-29 17:42:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:04] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 15 ms returned sat
[2025-05-29 17:42:04] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2025-05-29 17:42:04] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 56 ms.
[2025-05-29 17:42:05] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2025-05-29 17:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-05-29 17:42:05] [INFO ] Added : 55 causal constraints over 11 iterations in 831 ms. Result :sat
Minimization took 468 ms.
[2025-05-29 17:42:05] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:05] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 17 ms returned sat
[2025-05-29 17:42:05] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-29 17:42:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:06] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:42:06] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2025-05-29 17:42:06] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 53 ms.
[2025-05-29 17:42:06] [INFO ] Added : 8 causal constraints over 2 iterations in 216 ms. Result :sat
Minimization took 441 ms.
[2025-05-29 17:42:07] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:07] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:42:07] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2025-05-29 17:42:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:42:07] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 15 ms returned sat
[2025-05-29 17:42:07] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2025-05-29 17:42:07] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 60 ms.
[2025-05-29 17:42:08] [INFO ] Added : 21 causal constraints over 5 iterations in 350 ms. Result :sat
Minimization took 464 ms.
[2025-05-29 17:42:08] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:08] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:42:09] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2025-05-29 17:42:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:09] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:42:09] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-05-29 17:42:09] [INFO ] Computed and/alt/rep : 246/1099/246 causal constraints (skipped 808 transitions) in 60 ms.
[2025-05-29 17:42:10] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2025-05-29 17:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2025-05-29 17:42:10] [INFO ] Added : 40 causal constraints over 12 iterations in 913 ms. Result :sat
Minimization took 472 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1083/1083 transitions.
Applied a total of 0 rules in 19 ms. Remains 447 /447 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 447/447 places, 1083/1083 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1083/1083 transitions.
Applied a total of 0 rules in 13 ms. Remains 447 /447 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
[2025-05-29 17:42:11] [INFO ] Invariant cache hit.
[2025-05-29 17:42:12] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-29 17:42:12] [INFO ] Invariant cache hit.
[2025-05-29 17:42:12] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2025-05-29 17:42:13] [INFO ] Redundant transitions in 61 ms returned []
Running 1054 sub problems to find dead transitions.
[2025-05-29 17:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2025-05-29 17:42:24] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2025-05-29 17:42:25] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 2/46 constraints. Problems are: Problem set: 4 solved, 1050 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1530 variables, and 46 constraints, problems are : Problem set: 4 solved, 1050 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 1054/1054 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 11/11 constraints. Problems are: Problem set: 4 solved, 1050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 33/44 constraints. Problems are: Problem set: 4 solved, 1050 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 2/46 constraints. Problems are: Problem set: 4 solved, 1050 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 1050 unsolved
At refinement iteration 4 (OVERLAPS) 1/447 variables, 3/49 constraints. Problems are: Problem set: 4 solved, 1050 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 1/50 constraints. Problems are: Problem set: 4 solved, 1050 unsolved
[2025-05-29 17:43:02] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2025-05-29 17:43:09] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 4 ms to minimize.
[2025-05-29 17:43:10] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 2 ms to minimize.
[2025-05-29 17:43:13] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 60702ms, After SMT, problems are : Problem set: 4 solved, 1050 unsolved
Search for dead transitions found 4 dead transitions in 60722ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/447 places, 1079/1083 transitions.
Applied a total of 0 rules in 11 ms. Remains 447 /447 variables (removed 0) and now considering 1079/1079 (removed 0) transitions.
[2025-05-29 17:43:13] [INFO ] Redundant transitions in 60 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61953 ms. Remains : 447/447 places, 1079/1083 transitions.
// Phase 1: matrix 1079 rows 447 cols
[2025-05-29 17:43:13] [INFO ] Computed 48 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (18529 resets) in 1890 ms. (528 steps per ms)
BEST_FIRST walk for 6000005 steps (26872 resets) in 4508 ms. (1330 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:43:20] [INFO ] Invariant cache hit.
[2025-05-29 17:43:20] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:43:20] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:43:20] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2025-05-29 17:43:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:43:20] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:43:20] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2025-05-29 17:43:20] [INFO ] Computed and/alt/rep : 245/1117/245 causal constraints (skipped 805 transitions) in 54 ms.
[2025-05-29 17:43:21] [INFO ] Added : 14 causal constraints over 3 iterations in 281 ms. Result :sat
Minimization took 682 ms.
[2025-05-29 17:43:21] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:43:21] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 10 ms returned sat
[2025-05-29 17:43:22] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2025-05-29 17:43:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:43:22] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:43:22] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2025-05-29 17:43:22] [INFO ] Computed and/alt/rep : 245/1117/245 causal constraints (skipped 805 transitions) in 50 ms.
[2025-05-29 17:43:23] [INFO ] Added : 25 causal constraints over 5 iterations in 462 ms. Result :sat
Minimization took 594 ms.
[2025-05-29 17:43:23] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:43:23] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 12 ms returned sat
[2025-05-29 17:43:23] [INFO ] [Real]Absence check using state equation in 255 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 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:43:24] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:43:24] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-05-29 17:43:24] [INFO ] Computed and/alt/rep : 245/1117/245 causal constraints (skipped 805 transitions) in 51 ms.
[2025-05-29 17:43:24] [INFO ] Added : 31 causal constraints over 7 iterations in 530 ms. Result :sat
Minimization took 1209 ms.
[2025-05-29 17:43:26] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:43:26] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 16 ms returned sat
[2025-05-29 17:43:26] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2025-05-29 17:43:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:26] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 15 ms returned sat
[2025-05-29 17:43:26] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-05-29 17:43:26] [INFO ] Computed and/alt/rep : 245/1117/245 causal constraints (skipped 805 transitions) in 51 ms.
[2025-05-29 17:43:27] [INFO ] Added : 13 causal constraints over 4 iterations in 323 ms. Result :sat
Minimization took 561 ms.
[2025-05-29 17:43:27] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:43:27] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:43:28] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-29 17:43:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:28] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 10 ms returned sat
[2025-05-29 17:43:28] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2025-05-29 17:43:28] [INFO ] Computed and/alt/rep : 245/1117/245 causal constraints (skipped 805 transitions) in 51 ms.
[2025-05-29 17:43:28] [INFO ] Added : 20 causal constraints over 4 iterations in 380 ms. Result :sat
Minimization took 603 ms.
[2025-05-29 17:43:29] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:43:29] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:43:29] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-29 17:43:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:43:29] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:43:30] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-05-29 17:43:30] [INFO ] Computed and/alt/rep : 245/1117/245 causal constraints (skipped 805 transitions) in 51 ms.
[2025-05-29 17:43:30] [INFO ] Added : 46 causal constraints over 10 iterations in 618 ms. Result :sat
Minimization took 614 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1079/1079 transitions.
Applied a total of 0 rules in 11 ms. Remains 447 /447 variables (removed 0) and now considering 1079/1079 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 447/447 places, 1079/1079 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1079/1079 transitions.
Applied a total of 0 rules in 10 ms. Remains 447 /447 variables (removed 0) and now considering 1079/1079 (removed 0) transitions.
[2025-05-29 17:43:32] [INFO ] Invariant cache hit.
[2025-05-29 17:43:32] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-29 17:43:32] [INFO ] Invariant cache hit.
[2025-05-29 17:43:33] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2025-05-29 17:43:33] [INFO ] Redundant transitions in 11 ms returned []
Running 1050 sub problems to find dead transitions.
[2025-05-29 17:43:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2025-05-29 17:43:49] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1526 variables, and 45 constraints, problems are : Problem set: 0 solved, 1050 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 1050/1050 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 4 (OVERLAPS) 1/447 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2025-05-29 17:44:21] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-05-29 17:44:28] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 2 ms to minimize.
[2025-05-29 17:44:29] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 2 ms to minimize.
[2025-05-29 17:44:29] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 3 ms to minimize.
[2025-05-29 17:44:30] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-05-29 17:44:33] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 1)
(s386 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/1526 variables, and 55 constraints, problems are : Problem set: 0 solved, 1050 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/1050 constraints, Known Traps: 7/7 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 1050 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61516 ms. Remains : 447/447 places, 1079/1079 transitions.
RANDOM walk for 40000 steps (751 resets) in 1141 ms. (35 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (179 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (176 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (179 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (191 resets) in 232 ms. (171 steps per ms) remains 12/12 properties
[2025-05-29 17:44:34] [INFO ] Flatten gal took : 271 ms
BEST_FIRST walk for 40004 steps (181 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (181 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (167 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
[2025-05-29 17:44:34] [INFO ] Flatten gal took : 170 ms
BEST_FIRST walk for 40003 steps (190 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (177 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
[2025-05-29 17:44:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7904311863979464165.gal : 44 ms
BEST_FIRST walk for 40004 steps (180 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
[2025-05-29 17:44:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18254579678591009976.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/ReachabilityCardinality7904311863979464165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18254579678591009976.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (173 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (190 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality18254579678591009976.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :328 after 14688
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :14688 after 146600
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :146600 after 153688
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :153688 after 154568
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :154568 after 196008
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :196008 after 4.37328e+06
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4.37328e+06 after 4.26485e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.26485e+07 after 4.33418e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.33418e+07 after 2.49669e+08
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.49959e+09,1.56781,51724,2,34884,25,111854,6,0,2870,109007,0
Total reachable state count : 1499587077

Verifying 12 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,328,1.57136,51724,2,973,25,111854,7,0,2873,109007,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,328,1.57378,51724,2,973,25,111854,8,0,2874,109007,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1,1.57475,51724,2,448,25,111854,9,0,2876,109007,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1,1.57538,51724,2,448,25,111854,10,0,2877,109007,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,6,1.57626,51724,2,485,25,111854,11,0,2879,109007,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6,1.57688,51724,2,485,25,111854,12,0,2880,109007,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,44,1.57787,51724,2,760,25,111854,13,0,2882,109007,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,44,1.57863,51724,2,760,25,111854,14,0,2883,109007,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,6,1.58261,51724,2,550,25,111854,15,0,2885,109007,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,6,1.58606,51724,2,550,25,111854,16,0,2886,109007,0
Reachability property MAX5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,2,1.5872,51724,2,449,25,111854,17,0,2888,109007,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,2,1.58793,51724,2,449,25,111854,18,0,2889,109007,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 168985 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 12
Probabilistic random walk after 168985 steps, saw 81619 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
FORMULA ASLink-PT-05b-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 415385 ms.

BK_STOP 1748540677805

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-05b"
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-05b, 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-174853743000045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05b.tgz
mv ASLink-PT-05b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;