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-174853743000048.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-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-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 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 677K 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-07a-UpperBounds-00
FORMULA_NAME ASLink-PT-07a-UpperBounds-01
FORMULA_NAME ASLink-PT-07a-UpperBounds-02
FORMULA_NAME ASLink-PT-07a-UpperBounds-03
FORMULA_NAME ASLink-PT-07a-UpperBounds-04
FORMULA_NAME ASLink-PT-07a-UpperBounds-05
FORMULA_NAME ASLink-PT-07a-UpperBounds-06
FORMULA_NAME ASLink-PT-07a-UpperBounds-07
FORMULA_NAME ASLink-PT-07a-UpperBounds-08
FORMULA_NAME ASLink-PT-07a-UpperBounds-09
FORMULA_NAME ASLink-PT-07a-UpperBounds-10
FORMULA_NAME ASLink-PT-07a-UpperBounds-11
FORMULA_NAME ASLink-PT-07a-UpperBounds-12
FORMULA_NAME ASLink-PT-07a-UpperBounds-13
FORMULA_NAME ASLink-PT-07a-UpperBounds-14
FORMULA_NAME ASLink-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540449050

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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:40:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 17:40:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:40:50] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-05-29 17:40:50] [INFO ] Transformed 1601 places.
[2025-05-29 17:40:50] [INFO ] Transformed 2373 transitions.
[2025-05-29 17:40:50] [INFO ] Found NUPN structural information;
[2025-05-29 17:40:50] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2348 rows 1601 cols
[2025-05-29 17:40:50] [INFO ] Computed 308 invariants in 189 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (57 resets) in 83 ms. (119 steps per ms)
FORMULA ASLink-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (49 resets) in 194 ms. (461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:40:51] [INFO ] Invariant cache hit.
[2025-05-29 17:40:51] [INFO ] [Real]Absence check using 75 positive place invariants in 44 ms returned sat
[2025-05-29 17:40:51] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 58 ms returned sat
[2025-05-29 17:40:52] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2025-05-29 17:40:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 45 ms returned sat
[2025-05-29 17:40:53] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 69 ms returned sat
[2025-05-29 17:40:54] [INFO ] [Nat]Absence check using state equation in 1289 ms returned sat
[2025-05-29 17:40:54] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 29 ms to minimize.
[2025-05-29 17:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 569 ms
[2025-05-29 17:40:55] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 205 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 17:40:58] [INFO ] [Real]Absence check using 75 positive place invariants in 40 ms returned sat
[2025-05-29 17:40:58] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 59 ms returned sat
[2025-05-29 17:40:59] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2025-05-29 17:40:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:59] [INFO ] [Nat]Absence check using 75 positive place invariants in 36 ms returned sat
[2025-05-29 17:40:59] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 54 ms returned sat
[2025-05-29 17:41:00] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2025-05-29 17:41:00] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 3 ms to minimize.
[2025-05-29 17:41:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2025-05-29 17:41:00] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 136 ms.
[2025-05-29 17:41:04] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:41:04] [INFO ] [Real]Absence check using 75 positive place invariants in 36 ms returned sat
[2025-05-29 17:41:04] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 70 ms returned sat
[2025-05-29 17:41:05] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2025-05-29 17:41:05] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 126 ms.
[2025-05-29 17:41:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:06] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2025-05-29 17:41:06] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 60 ms returned sat
[2025-05-29 17:41:07] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2025-05-29 17:41:07] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 126 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:41:11] [INFO ] [Real]Absence check using 75 positive place invariants in 34 ms returned sat
[2025-05-29 17:41:11] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 66 ms returned sat
[2025-05-29 17:41:12] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2025-05-29 17:41:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 36 ms returned sat
[2025-05-29 17:41:12] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 55 ms returned sat
[2025-05-29 17:41:13] [INFO ] [Nat]Absence check using state equation in 839 ms returned sat
[2025-05-29 17:41:13] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 129 ms.
[2025-05-29 17:41:14] [INFO ] Added : 5 causal constraints over 1 iterations in 1138 ms. Result :sat
Minimization took 624 ms.
[2025-05-29 17:41:15] [INFO ] [Real]Absence check using 75 positive place invariants in 35 ms returned sat
[2025-05-29 17:41:15] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 56 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Real]Absence check using state equation in 750 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 75 positive place invariants in 35 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 54 ms returned sat
[2025-05-29 17:41:17] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2025-05-29 17:41:17] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 109 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 17:41:21] [INFO ] [Real]Absence check using 75 positive place invariants in 37 ms returned sat
[2025-05-29 17:41:21] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 62 ms returned sat
[2025-05-29 17:41:22] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2025-05-29 17:41:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:22] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2025-05-29 17:41:22] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 62 ms returned sat
[2025-05-29 17:41:24] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2025-05-29 17:41:24] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2025-05-29 17:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2025-05-29 17:41:24] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 121 ms.
[2025-05-29 17:41:25] [INFO ] Added : 5 causal constraints over 1 iterations in 1135 ms. Result :sat
Minimization took 621 ms.
[2025-05-29 17:41:26] [INFO ] [Real]Absence check using 75 positive place invariants in 37 ms returned sat
[2025-05-29 17:41:26] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 59 ms returned sat
[2025-05-29 17:41:27] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2025-05-29 17:41:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:27] [INFO ] [Nat]Absence check using 75 positive place invariants in 37 ms returned sat
[2025-05-29 17:41:27] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 57 ms returned sat
[2025-05-29 17:41:28] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2025-05-29 17:41:28] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 130 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-29 17:41:32] [INFO ] [Real]Absence check using 75 positive place invariants in 34 ms returned sat
[2025-05-29 17:41:32] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 56 ms returned sat
[2025-05-29 17:41:33] [INFO ] [Real]Absence check using state equation in 910 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 75 positive place invariants in 35 ms returned sat
[2025-05-29 17:41:33] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 56 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2025-05-29 17:41:35] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 130 ms.
[2025-05-29 17:41:38] [INFO ] Added : 140 causal constraints over 28 iterations in 3674 ms. Result :unknown
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using 75 positive place invariants in 35 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 69 ms returned sat
[2025-05-29 17:41:39] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2025-05-29 17:41:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 75 positive place invariants in 36 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 57 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2025-05-29 17:41:41] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 111 ms.
[2025-05-29 17:41:45] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1559 transition count 2204
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 330 place count 1415 transition count 2204
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 330 place count 1415 transition count 2056
Deduced a syphon composed of 148 places in 4 ms
Ensure Unique test removed 57 places
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 2 with 353 rules applied. Total rules applied 683 place count 1210 transition count 2056
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 684 place count 1210 transition count 2055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 1209 transition count 2055
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 695 place count 1199 transition count 2002
Ensure Unique test removed 1 places
Iterating global reduction 4 with 11 rules applied. Total rules applied 706 place count 1198 transition count 2002
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 712 place count 1197 transition count 1997
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 715 place count 1194 transition count 1997
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 716 place count 1193 transition count 1989
Iterating global reduction 6 with 1 rules applied. Total rules applied 717 place count 1193 transition count 1989
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 718 place count 1192 transition count 1981
Iterating global reduction 6 with 1 rules applied. Total rules applied 719 place count 1192 transition count 1981
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 720 place count 1191 transition count 1973
Iterating global reduction 6 with 1 rules applied. Total rules applied 721 place count 1191 transition count 1973
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 722 place count 1190 transition count 1965
Iterating global reduction 6 with 1 rules applied. Total rules applied 723 place count 1190 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 724 place count 1189 transition count 1957
Iterating global reduction 6 with 1 rules applied. Total rules applied 725 place count 1189 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 726 place count 1188 transition count 1949
Iterating global reduction 6 with 1 rules applied. Total rules applied 727 place count 1188 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 728 place count 1187 transition count 1941
Iterating global reduction 6 with 1 rules applied. Total rules applied 729 place count 1187 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 730 place count 1186 transition count 1933
Iterating global reduction 6 with 1 rules applied. Total rules applied 731 place count 1186 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 732 place count 1185 transition count 1925
Iterating global reduction 6 with 1 rules applied. Total rules applied 733 place count 1185 transition count 1925
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 734 place count 1184 transition count 1917
Iterating global reduction 6 with 1 rules applied. Total rules applied 735 place count 1184 transition count 1917
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 736 place count 1183 transition count 1909
Iterating global reduction 6 with 1 rules applied. Total rules applied 737 place count 1183 transition count 1909
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 738 place count 1182 transition count 1901
Iterating global reduction 6 with 1 rules applied. Total rules applied 739 place count 1182 transition count 1901
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 740 place count 1181 transition count 1893
Iterating global reduction 6 with 1 rules applied. Total rules applied 741 place count 1181 transition count 1893
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 742 place count 1180 transition count 1885
Iterating global reduction 6 with 1 rules applied. Total rules applied 743 place count 1180 transition count 1885
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 744 place count 1179 transition count 1877
Iterating global reduction 6 with 1 rules applied. Total rules applied 745 place count 1179 transition count 1877
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 746 place count 1178 transition count 1869
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 1178 transition count 1869
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 845 place count 1129 transition count 1820
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 851 place count 1129 transition count 1814
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 857 place count 1123 transition count 1814
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 864 place count 1123 transition count 1814
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 865 place count 1122 transition count 1813
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 879 place count 1108 transition count 1813
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 28 Pre rules applied. Total rules applied 879 place count 1108 transition count 1785
Deduced a syphon composed of 28 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 57 rules applied. Total rules applied 936 place count 1079 transition count 1785
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 8 with 8 rules applied. Total rules applied 944 place count 1071 transition count 1785
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 944 place count 1071 transition count 1784
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 946 place count 1070 transition count 1784
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 962 place count 1062 transition count 1776
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 969 place count 1055 transition count 1769
Iterating global reduction 9 with 7 rules applied. Total rules applied 976 place count 1055 transition count 1769
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 983 place count 1055 transition count 1762
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 990 place count 1048 transition count 1762
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 997 place count 1048 transition count 1762
Applied a total of 997 rules in 1295 ms. Remains 1048 /1601 variables (removed 553) and now considering 1762/2348 (removed 586) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1306 ms. Remains : 1048/1601 places, 1762/2348 transitions.
// Phase 1: matrix 1762 rows 1048 cols
[2025-05-29 17:41:48] [INFO ] Computed 184 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (10859 resets) in 3192 ms. (313 steps per ms)
BEST_FIRST walk for 8000006 steps (12307 resets) in 10562 ms. (757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:42:02] [INFO ] Invariant cache hit.
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 29 ms returned sat
[2025-05-29 17:42:03] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2025-05-29 17:42:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:42:03] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 39 ms returned sat
[2025-05-29 17:42:04] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2025-05-29 17:42:04] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 93 ms.
[2025-05-29 17:42:13] [INFO ] Added : 491 causal constraints over 99 iterations in 8946 ms. Result :sat
Minimization took 1823 ms.
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 29 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2025-05-29 17:42:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:15] [INFO ] [Nat]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 28 ms returned sat
[2025-05-29 17:42:16] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2025-05-29 17:42:16] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 91 ms.
[2025-05-29 17:42:24] [INFO ] Added : 409 causal constraints over 82 iterations in 8162 ms. Result :sat
Minimization took 1679 ms.
[2025-05-29 17:42:26] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:42:26] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 37 ms returned sat
[2025-05-29 17:42:27] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2025-05-29 17:42:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:27] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2025-05-29 17:42:27] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 29 ms returned sat
[2025-05-29 17:42:28] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2025-05-29 17:42:28] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 97 ms.
[2025-05-29 17:42:37] [INFO ] Added : 474 causal constraints over 95 iterations in 9080 ms. Result :sat
Minimization took 2156 ms.
[2025-05-29 17:42:39] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:42:39] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 29 ms returned sat
[2025-05-29 17:42:40] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2025-05-29 17:42:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-05-29 17:42:40] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 28 ms returned sat
[2025-05-29 17:42:40] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2025-05-29 17:42:41] [INFO ] Deduced a trap composed of 111 places in 286 ms of which 6 ms to minimize.
[2025-05-29 17:42:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2025-05-29 17:42:41] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 99 ms.
[2025-05-29 17:42:51] [INFO ] Added : 545 causal constraints over 109 iterations in 10461 ms. Result :sat
Minimization took 2222 ms.
[2025-05-29 17:42:53] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:42:53] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 26 ms returned sat
[2025-05-29 17:42:54] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2025-05-29 17:42:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:54] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2025-05-29 17:42:54] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 30 ms returned sat
[2025-05-29 17:42:55] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2025-05-29 17:42:55] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 97 ms.
[2025-05-29 17:43:05] [INFO ] Added : 535 causal constraints over 107 iterations in 9745 ms. Result :sat
Minimization took 1761 ms.
[2025-05-29 17:43:07] [INFO ] [Real]Absence check using 45 positive place invariants in 19 ms returned sat
[2025-05-29 17:43:07] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 28 ms returned sat
[2025-05-29 17:43:07] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2025-05-29 17:43:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:07] [INFO ] [Nat]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:43:07] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 28 ms returned sat
[2025-05-29 17:43:08] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2025-05-29 17:43:08] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 87 ms.
[2025-05-29 17:43:18] [INFO ] Added : 544 causal constraints over 109 iterations in 10082 ms. Result :sat
Minimization took 1833 ms.
[2025-05-29 17:43:20] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-05-29 17:43:20] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 30 ms returned sat
[2025-05-29 17:43:20] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2025-05-29 17:43:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:21] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-05-29 17:43:21] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 28 ms returned sat
[2025-05-29 17:43:21] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-05-29 17:43:21] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 89 ms.
[2025-05-29 17:43:31] [INFO ] Added : 535 causal constraints over 107 iterations in 9741 ms. Result :sat
Minimization took 1832 ms.
[2025-05-29 17:43:33] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-05-29 17:43:33] [INFO ] [Real]Absence check using 45 positive and 139 generalized place invariants in 31 ms returned sat
[2025-05-29 17:43:34] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2025-05-29 17:43:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-05-29 17:43:34] [INFO ] [Nat]Absence check using 45 positive and 139 generalized place invariants in 27 ms returned sat
[2025-05-29 17:43:34] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2025-05-29 17:43:34] [INFO ] Computed and/alt/rep : 698/2647/698 causal constraints (skipped 1027 transitions) in 100 ms.
[2025-05-29 17:43:43] [INFO ] Added : 494 causal constraints over 99 iterations in 8885 ms. Result :sat
Minimization took 1997 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 1048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1762/1762 transitions.
Applied a total of 0 rules in 32 ms. Remains 1048 /1048 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1048/1048 places, 1762/1762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1762/1762 transitions.
Applied a total of 0 rules in 37 ms. Remains 1048 /1048 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
[2025-05-29 17:43:52] [INFO ] Invariant cache hit.
[2025-05-29 17:43:52] [INFO ] Implicit Places using invariants in 690 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 223, 260, 264, 265, 276, 277, 278, 296, 314, 383, 387, 388, 399, 400, 401, 419, 437, 506, 510, 511, 522, 523, 524, 542, 560, 629, 633, 634, 645, 646, 647, 665, 683, 752, 756, 757, 768, 769, 770, 788, 806, 875, 879, 880, 883, 894, 895, 896, 914, 916, 919, 937, 938, 939, 940, 952, 958, 964, 970, 976, 982, 988, 994, 1000, 1006, 1012]
[2025-05-29 17:43:52] [INFO ] Actually due to overlaps returned [914, 896, 30, 48, 150, 168, 278, 296, 401, 419, 524, 542, 647, 665, 770, 788, 919, 149, 277, 400, 523, 646, 769, 895, 938, 148, 276, 399, 522, 645, 768, 894, 916, 937, 0, 264, 265, 387, 388, 510, 511, 633, 634, 756, 757, 879, 880, 19, 66, 186, 314, 437, 560, 683, 806, 940, 982, 1000, 1012, 18, 883, 939, 952, 958, 964, 970, 976, 988, 994, 1006]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 696 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 978/1048 places, 1762/1762 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 971 transition count 1629
Reduce places removed 133 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 274 place count 838 transition count 1628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 837 transition count 1628
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 275 place count 837 transition count 1594
Deduced a syphon composed of 34 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 344 place count 802 transition count 1594
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 356 place count 798 transition count 1586
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 364 place count 790 transition count 1586
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 379 place count 775 transition count 1571
Iterating global reduction 5 with 15 rules applied. Total rules applied 394 place count 775 transition count 1571
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 397 place count 775 transition count 1568
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 397 place count 775 transition count 1567
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 399 place count 774 transition count 1567
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 402 place count 771 transition count 1564
Iterating global reduction 6 with 3 rules applied. Total rules applied 405 place count 771 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 406 place count 770 transition count 1563
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 770 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 408 place count 769 transition count 1562
Iterating global reduction 6 with 1 rules applied. Total rules applied 409 place count 769 transition count 1562
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 527 place count 710 transition count 1503
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 534 place count 710 transition count 1496
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 541 place count 703 transition count 1489
Iterating global reduction 7 with 7 rules applied. Total rules applied 548 place count 703 transition count 1489
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 555 place count 703 transition count 1482
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 8 with 15 rules applied. Total rules applied 570 place count 703 transition count 1467
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 586 place count 687 transition count 1467
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 606 place count 687 transition count 1467
Applied a total of 606 rules in 270 ms. Remains 687 /978 variables (removed 291) and now considering 1467/1762 (removed 295) transitions.
// Phase 1: matrix 1467 rows 687 cols
[2025-05-29 17:43:53] [INFO ] Computed 101 invariants in 17 ms
[2025-05-29 17:43:53] [INFO ] Implicit Places using invariants in 449 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 159, 172, 183, 189, 192, 194, 199, 200, 252, 269, 275, 278, 280, 285, 286, 338, 355, 361, 364, 366, 371, 372, 424, 441, 447, 450, 452, 457, 458, 510, 527, 533, 536, 538, 543, 544, 596, 613, 619, 622, 624]
[2025-05-29 17:43:53] [INFO ] Actually due to overlaps returned [106, 199, 285, 371, 457, 543, 107, 200, 286, 372, 458, 544, 91, 97, 102, 183, 189, 194, 269, 275, 280, 361, 366, 441, 447, 452, 527, 533, 538, 613, 619, 624, 74, 103, 159, 172, 252, 338, 355, 424, 510, 596]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 452 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 645/1048 places, 1467/1762 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 618 transition count 1440
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 618 transition count 1440
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 612 transition count 1434
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 612 transition count 1434
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 94 place count 598 transition count 1420
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 115 place count 598 transition count 1399
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 136 place count 577 transition count 1399
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 143 place count 577 transition count 1392
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 150 place count 570 transition count 1392
Applied a total of 150 rules in 106 ms. Remains 570 /645 variables (removed 75) and now considering 1392/1467 (removed 75) transitions.
// Phase 1: matrix 1392 rows 570 cols
[2025-05-29 17:43:53] [INFO ] Computed 59 invariants in 16 ms
[2025-05-29 17:43:54] [INFO ] Implicit Places using invariants in 332 ms returned []
[2025-05-29 17:43:54] [INFO ] Invariant cache hit.
[2025-05-29 17:43:55] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 570/1048 places, 1392/1762 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3093 ms. Remains : 570/1048 places, 1392/1762 transitions.
[2025-05-29 17:43:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (17571 resets) in 2134 ms. (468 steps per ms)
FORMULA ASLink-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000006 steps (23936 resets) in 5413 ms. (1292 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:44:02] [INFO ] Invariant cache hit.
[2025-05-29 17:44:02] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:02] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:03] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2025-05-29 17:44:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:03] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:03] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2025-05-29 17:44:04] [INFO ] Computed and/alt/rep : 314/1358/314 causal constraints (skipped 1044 transitions) in 78 ms.
[2025-05-29 17:44:04] [INFO ] Added : 35 causal constraints over 8 iterations in 670 ms. Result :sat
Minimization took 555 ms.
[2025-05-29 17:44:05] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:05] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:05] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-05-29 17:44:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:05] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:06] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2025-05-29 17:44:06] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 3 ms to minimize.
[2025-05-29 17:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-05-29 17:44:06] [INFO ] Computed and/alt/rep : 314/1358/314 causal constraints (skipped 1044 transitions) in 94 ms.
[2025-05-29 17:44:06] [INFO ] Added : 12 causal constraints over 3 iterations in 399 ms. Result :sat
Minimization took 510 ms.
[2025-05-29 17:44:07] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:07] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:07] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-05-29 17:44:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:07] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:08] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2025-05-29 17:44:08] [INFO ] Computed and/alt/rep : 314/1358/314 causal constraints (skipped 1044 transitions) in 70 ms.
[2025-05-29 17:44:08] [INFO ] Added : 35 causal constraints over 8 iterations in 649 ms. Result :sat
Minimization took 594 ms.
[2025-05-29 17:44:09] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:09] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:09] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2025-05-29 17:44:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:09] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:10] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2025-05-29 17:44:10] [INFO ] Computed and/alt/rep : 314/1358/314 causal constraints (skipped 1044 transitions) in 73 ms.
[2025-05-29 17:44:10] [INFO ] Added : 19 causal constraints over 5 iterations in 469 ms. Result :sat
Minimization took 520 ms.
[2025-05-29 17:44:11] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:11] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:11] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2025-05-29 17:44:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:12] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:12] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-05-29 17:44:12] [INFO ] Computed and/alt/rep : 314/1358/314 causal constraints (skipped 1044 transitions) in 89 ms.
[2025-05-29 17:44:12] [INFO ] Added : 24 causal constraints over 5 iterations in 576 ms. Result :sat
Minimization took 586 ms.
[2025-05-29 17:44:13] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:13] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:13] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-05-29 17:44:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:14] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:14] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2025-05-29 17:44:14] [INFO ] Computed and/alt/rep : 314/1358/314 causal constraints (skipped 1044 transitions) in 71 ms.
[2025-05-29 17:44:14] [INFO ] Added : 23 causal constraints over 5 iterations in 492 ms. Result :sat
Minimization took 630 ms.
[2025-05-29 17:44:15] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:15] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:16] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-05-29 17:44:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:16] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:16] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2025-05-29 17:44:16] [INFO ] Computed and/alt/rep : 314/1358/314 causal constraints (skipped 1044 transitions) in 71 ms.
[2025-05-29 17:44:17] [INFO ] Added : 50 causal constraints over 10 iterations in 882 ms. Result :sat
Minimization took 556 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-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1392/1392 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 569 transition count 1391
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 569 transition count 1391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 568 transition count 1390
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 568 transition count 1390
Applied a total of 4 rules in 39 ms. Remains 568 /570 variables (removed 2) and now considering 1390/1392 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 568/570 places, 1390/1392 transitions.
// Phase 1: matrix 1390 rows 568 cols
[2025-05-29 17:44:20] [INFO ] Computed 59 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (17446 resets) in 2095 ms. (477 steps per ms)
BEST_FIRST walk for 5000004 steps (16987 resets) in 3867 ms. (1292 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 17:44:26] [INFO ] Invariant cache hit.
[2025-05-29 17:44:26] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:26] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 14 ms returned sat
[2025-05-29 17:44:26] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-05-29 17:44:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2025-05-29 17:44:26] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:27] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2025-05-29 17:44:27] [INFO ] Computed and/alt/rep : 312/1354/312 causal constraints (skipped 1044 transitions) in 68 ms.
[2025-05-29 17:44:27] [INFO ] Added : 27 causal constraints over 6 iterations in 529 ms. Result :sat
Minimization took 689 ms.
[2025-05-29 17:44:28] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:28] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:28] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2025-05-29 17:44:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:28] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:29] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-05-29 17:44:29] [INFO ] Computed and/alt/rep : 312/1354/312 causal constraints (skipped 1044 transitions) in 76 ms.
[2025-05-29 17:44:30] [INFO ] Added : 52 causal constraints over 11 iterations in 835 ms. Result :sat
Minimization took 642 ms.
[2025-05-29 17:44:30] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:30] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2025-05-29 17:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 15 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-05-29 17:44:31] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2025-05-29 17:44:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-05-29 17:44:31] [INFO ] Computed and/alt/rep : 312/1354/312 causal constraints (skipped 1044 transitions) in 69 ms.
[2025-05-29 17:44:32] [INFO ] Added : 37 causal constraints over 8 iterations in 738 ms. Result :sat
Minimization took 704 ms.
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2025-05-29 17:44:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 12 ms returned sat
[2025-05-29 17:44:34] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-05-29 17:44:34] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2025-05-29 17:44:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2025-05-29 17:44:34] [INFO ] Computed and/alt/rep : 312/1354/312 causal constraints (skipped 1044 transitions) in 66 ms.
[2025-05-29 17:44:35] [INFO ] Added : 38 causal constraints over 8 iterations in 720 ms. Result :sat
Minimization took 691 ms.
[2025-05-29 17:44:35] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:35] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:36] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2025-05-29 17:44:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:44:36] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 13 ms returned sat
[2025-05-29 17:44:36] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2025-05-29 17:44:36] [INFO ] Computed and/alt/rep : 312/1354/312 causal constraints (skipped 1044 transitions) in 74 ms.
[2025-05-29 17:44:37] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2025-05-29 17:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-05-29 17:44:38] [INFO ] Added : 61 causal constraints over 13 iterations in 1228 ms. Result :sat
Minimization took 697 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 1390/1390 transitions.
Applied a total of 0 rules in 16 ms. Remains 568 /568 variables (removed 0) and now considering 1390/1390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 568/568 places, 1390/1390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 1390/1390 transitions.
Applied a total of 0 rules in 16 ms. Remains 568 /568 variables (removed 0) and now considering 1390/1390 (removed 0) transitions.
[2025-05-29 17:44:40] [INFO ] Invariant cache hit.
[2025-05-29 17:44:40] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-05-29 17:44:40] [INFO ] Invariant cache hit.
[2025-05-29 17:44:41] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2025-05-29 17:44:41] [INFO ] Redundant transitions in 99 ms returned []
Running 1356 sub problems to find dead transitions.
[2025-05-29 17:44:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/1958 variables, and 55 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 44/45 constraints, State Equation: 0/568 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 3 (OVERLAPS) 1/568 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/1958 variables, and 59 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/568 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 0/0 constraints]
After SMT, in 60949ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 60973ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62509 ms. Remains : 568/568 places, 1390/1390 transitions.
RANDOM walk for 40000 steps (705 resets) in 1530 ms. (26 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (138 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (127 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (142 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
[2025-05-29 17:45:43] [INFO ] Flatten gal took : 276 ms
BEST_FIRST walk for 40004 steps (138 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
[2025-05-29 17:45:43] [INFO ] Flatten gal took : 125 ms
BEST_FIRST walk for 40003 steps (136 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (131 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
[2025-05-29 17:45:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5545212918433345486.gal : 65 ms
[2025-05-29 17:45:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14042998676110620516.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/ReachabilityCardinality5545212918433345486.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14042998676110620516.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 (132 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (140 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (137 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (139 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality14042998676110620516.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :18272 after 7.22835e+06
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :7.22835e+06 after 8.43246e+06
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :8.43246e+06 after 8.59577e+06
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :8.59577e+06 after 8.72139e+06
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :8.72139e+06 after 2.39175e+08
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.39175e+08 after 2.72577e+09
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
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,2.48781e+10,1.91669,59620,2,39389,22,119595,6,0,3665,87956,0
Total reachable state count : 24878079112

Verifying 10 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,1,1.92506,59620,2,569,22,119595,7,0,3668,87956,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,1,1.93157,59620,2,569,22,119595,8,0,3669,87956,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,6,1.94038,59620,2,679,22,119595,9,0,3671,87956,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,6,1.94895,59620,2,679,22,119595,10,0,3672,87956,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,12,1.95852,59620,2,680,22,119595,11,0,3674,87956,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,12,1.96775,59620,2,680,22,119595,12,0,3675,87956,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,12,1.97794,59620,2,680,22,119595,13,0,3677,87956,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,12,1.98844,59620,2,680,22,119595,14,0,3678,87956,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,1,1.99473,59620,2,569,22,119595,15,0,3680,87956,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,1,2.00069,59620,2,569,22,119595,16,0,3681,87956,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 161654 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 10
Probabilistic random walk after 161654 steps, saw 104715 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
FORMULA ASLink-PT-07a-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-07a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-07a-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-07a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-07a-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-07a-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 296555 ms.

BK_STOP 1748540746838

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-07a"
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-07a, 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-174853743000048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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