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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 597K 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-06a-UpperBounds-00
FORMULA_NAME ASLink-PT-06a-UpperBounds-01
FORMULA_NAME ASLink-PT-06a-UpperBounds-02
FORMULA_NAME ASLink-PT-06a-UpperBounds-03
FORMULA_NAME ASLink-PT-06a-UpperBounds-04
FORMULA_NAME ASLink-PT-06a-UpperBounds-05
FORMULA_NAME ASLink-PT-06a-UpperBounds-06
FORMULA_NAME ASLink-PT-06a-UpperBounds-07
FORMULA_NAME ASLink-PT-06a-UpperBounds-08
FORMULA_NAME ASLink-PT-06a-UpperBounds-09
FORMULA_NAME ASLink-PT-06a-UpperBounds-10
FORMULA_NAME ASLink-PT-06a-UpperBounds-11
FORMULA_NAME ASLink-PT-06a-UpperBounds-12
FORMULA_NAME ASLink-PT-06a-UpperBounds-13
FORMULA_NAME ASLink-PT-06a-UpperBounds-14
FORMULA_NAME ASLink-PT-06a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540269098

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37: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:37:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:50] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-05-29 17:37:50] [INFO ] Transformed 1406 places.
[2025-05-29 17:37:50] [INFO ] Transformed 2100 transitions.
[2025-05-29 17:37:50] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:50] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2078 rows 1406 cols
[2025-05-29 17:37:50] [INFO ] Computed 270 invariants in 157 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (52 resets) in 70 ms. (140 steps per ms)
FORMULA ASLink-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (31 resets) in 103 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:37:51] [INFO ] Invariant cache hit.
[2025-05-29 17:37:51] [INFO ] [Real]Absence check using 66 positive place invariants in 34 ms returned sat
[2025-05-29 17:37:51] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 48 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2025-05-29 17:37:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 32 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 52 ms returned sat
[2025-05-29 17:37:53] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2025-05-29 17:37:54] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 149 ms.
[2025-05-29 17:37:57] [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: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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:37:57] [INFO ] [Real]Absence check using 66 positive place invariants in 43 ms returned sat
[2025-05-29 17:37:57] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 51 ms returned sat
[2025-05-29 17:37:58] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2025-05-29 17:37:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 35 ms returned sat
[2025-05-29 17:37:59] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 53 ms returned sat
[2025-05-29 17:37:59] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2025-05-29 17:38:00] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 129 ms.
[2025-05-29 17:38:03] [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:38:04] [INFO ] [Real]Absence check using 66 positive place invariants in 34 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 49 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2025-05-29 17:38:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:05] [INFO ] [Nat]Absence check using 66 positive place invariants in 32 ms returned sat
[2025-05-29 17:38:05] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 52 ms returned sat
[2025-05-29 17:38:06] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2025-05-29 17:38:06] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 15 ms to minimize.
[2025-05-29 17:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2025-05-29 17:38:06] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 123 ms.
[2025-05-29 17:38:07] [INFO ] Added : 5 causal constraints over 1 iterations in 916 ms. Result :sat
Minimization took 609 ms.
[2025-05-29 17:38:08] [INFO ] [Real]Absence check using 66 positive place invariants in 33 ms returned sat
[2025-05-29 17:38:08] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 52 ms returned sat
[2025-05-29 17:38:08] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2025-05-29 17:38:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 33 ms returned sat
[2025-05-29 17:38:09] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 49 ms returned sat
[2025-05-29 17:38:10] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2025-05-29 17:38:10] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 158 ms.
[2025-05-29 17:38:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 1370 transition count 1952
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 288 place count 1244 transition count 1952
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 288 place count 1244 transition count 1824
Deduced a syphon composed of 128 places in 2 ms
Ensure Unique test removed 50 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 594 place count 1066 transition count 1824
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 595 place count 1066 transition count 1823
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 1065 transition count 1823
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 605 place count 1056 transition count 1776
Ensure Unique test removed 1 places
Iterating global reduction 4 with 10 rules applied. Total rules applied 615 place count 1055 transition count 1776
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 621 place count 1054 transition count 1771
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 624 place count 1051 transition count 1771
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 625 place count 1050 transition count 1763
Iterating global reduction 6 with 1 rules applied. Total rules applied 626 place count 1050 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 627 place count 1049 transition count 1755
Iterating global reduction 6 with 1 rules applied. Total rules applied 628 place count 1049 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 629 place count 1048 transition count 1747
Iterating global reduction 6 with 1 rules applied. Total rules applied 630 place count 1048 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 631 place count 1047 transition count 1739
Iterating global reduction 6 with 1 rules applied. Total rules applied 632 place count 1047 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 633 place count 1046 transition count 1731
Iterating global reduction 6 with 1 rules applied. Total rules applied 634 place count 1046 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 635 place count 1045 transition count 1723
Iterating global reduction 6 with 1 rules applied. Total rules applied 636 place count 1045 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 637 place count 1044 transition count 1715
Iterating global reduction 6 with 1 rules applied. Total rules applied 638 place count 1044 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 639 place count 1043 transition count 1707
Iterating global reduction 6 with 1 rules applied. Total rules applied 640 place count 1043 transition count 1707
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 641 place count 1042 transition count 1699
Iterating global reduction 6 with 1 rules applied. Total rules applied 642 place count 1042 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 643 place count 1041 transition count 1691
Iterating global reduction 6 with 1 rules applied. Total rules applied 644 place count 1041 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 645 place count 1040 transition count 1683
Iterating global reduction 6 with 1 rules applied. Total rules applied 646 place count 1040 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 647 place count 1039 transition count 1675
Iterating global reduction 6 with 1 rules applied. Total rules applied 648 place count 1039 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 649 place count 1038 transition count 1667
Iterating global reduction 6 with 1 rules applied. Total rules applied 650 place count 1038 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 651 place count 1037 transition count 1659
Iterating global reduction 6 with 1 rules applied. Total rules applied 652 place count 1037 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 653 place count 1036 transition count 1651
Iterating global reduction 6 with 1 rules applied. Total rules applied 654 place count 1036 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 655 place count 1035 transition count 1643
Iterating global reduction 6 with 1 rules applied. Total rules applied 656 place count 1035 transition count 1643
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 740 place count 993 transition count 1601
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 745 place count 993 transition count 1596
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 750 place count 988 transition count 1596
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 757 place count 988 transition count 1596
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 758 place count 987 transition count 1595
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 770 place count 975 transition count 1595
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 770 place count 975 transition count 1571
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 49 rules applied. Total rules applied 819 place count 950 transition count 1571
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 8 with 7 rules applied. Total rules applied 826 place count 943 transition count 1571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 826 place count 943 transition count 1570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 828 place count 942 transition count 1570
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 842 place count 935 transition count 1563
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 848 place count 929 transition count 1557
Iterating global reduction 9 with 6 rules applied. Total rules applied 854 place count 929 transition count 1557
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 860 place count 929 transition count 1551
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 866 place count 923 transition count 1551
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 872 place count 923 transition count 1551
Applied a total of 872 rules in 1539 ms. Remains 923 /1406 variables (removed 483) and now considering 1551/2078 (removed 527) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1550 ms. Remains : 923/1406 places, 1551/2078 transitions.
// Phase 1: matrix 1551 rows 923 cols
[2025-05-29 17:38:15] [INFO ] Computed 162 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (11499 resets) in 3004 ms. (332 steps per ms)
FORMULA ASLink-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (5582 resets) in 3962 ms. (757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:38:22] [INFO ] Invariant cache hit.
[2025-05-29 17:38:22] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:38:22] [INFO ] [Real]Absence check using 40 positive and 122 generalized place invariants in 26 ms returned sat
[2025-05-29 17:38:23] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-05-29 17:38:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:38:23] [INFO ] [Nat]Absence check using 40 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:38:23] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2025-05-29 17:38:24] [INFO ] Computed and/alt/rep : 611/2329/611 causal constraints (skipped 907 transitions) in 95 ms.
[2025-05-29 17:38:30] [INFO ] Added : 387 causal constraints over 78 iterations in 6478 ms. Result :sat
Minimization took 1537 ms.
[2025-05-29 17:38:32] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:38:32] [INFO ] [Real]Absence check using 40 positive and 122 generalized place invariants in 25 ms returned sat
[2025-05-29 17:38:32] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2025-05-29 17:38:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2025-05-29 17:38:32] [INFO ] [Nat]Absence check using 40 positive and 122 generalized place invariants in 26 ms returned sat
[2025-05-29 17:38:33] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2025-05-29 17:38:33] [INFO ] Computed and/alt/rep : 611/2329/611 causal constraints (skipped 907 transitions) in 74 ms.
[2025-05-29 17:38:39] [INFO ] Added : 396 causal constraints over 80 iterations in 6454 ms. Result :sat
Minimization took 1689 ms.
[2025-05-29 17:38:41] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:38:41] [INFO ] [Real]Absence check using 40 positive and 122 generalized place invariants in 26 ms returned sat
[2025-05-29 17:38:42] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2025-05-29 17:38:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:38:42] [INFO ] [Nat]Absence check using 40 positive and 122 generalized place invariants in 25 ms returned sat
[2025-05-29 17:38:42] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2025-05-29 17:38:42] [INFO ] Computed and/alt/rep : 611/2329/611 causal constraints (skipped 907 transitions) in 82 ms.
[2025-05-29 17:38:50] [INFO ] Added : 469 causal constraints over 94 iterations in 7972 ms. Result :sat
Minimization took 1577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1551/1551 transitions.
Applied a total of 0 rules in 30 ms. Remains 923 /923 variables (removed 0) and now considering 1551/1551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 923/923 places, 1551/1551 transitions.
[2025-05-29 17:38:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (11571 resets) in 2648 ms. (377 steps per ms)
FORMULA ASLink-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (3753 resets) in 2451 ms. (815 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:38:58] [INFO ] Invariant cache hit.
[2025-05-29 17:38:59] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2025-05-29 17:38:59] [INFO ] [Real]Absence check using 40 positive and 122 generalized place invariants in 26 ms returned sat
[2025-05-29 17:38:59] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2025-05-29 17:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:38:59] [INFO ] [Nat]Absence check using 40 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:39:00] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2025-05-29 17:39:00] [INFO ] Computed and/alt/rep : 611/2329/611 causal constraints (skipped 907 transitions) in 79 ms.
[2025-05-29 17:39:06] [INFO ] Added : 396 causal constraints over 80 iterations in 6487 ms. Result :sat
Minimization took 1639 ms.
[2025-05-29 17:39:08] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:39:08] [INFO ] [Real]Absence check using 40 positive and 122 generalized place invariants in 25 ms returned sat
[2025-05-29 17:39:08] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2025-05-29 17:39:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2025-05-29 17:39:09] [INFO ] [Nat]Absence check using 40 positive and 122 generalized place invariants in 33 ms returned sat
[2025-05-29 17:39:09] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2025-05-29 17:39:09] [INFO ] Computed and/alt/rep : 611/2329/611 causal constraints (skipped 907 transitions) in 88 ms.
[2025-05-29 17:39:17] [INFO ] Added : 469 causal constraints over 94 iterations in 7963 ms. Result :sat
Minimization took 1704 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1551/1551 transitions.
Applied a total of 0 rules in 29 ms. Remains 923 /923 variables (removed 0) and now considering 1551/1551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 923/923 places, 1551/1551 transitions.
[2025-05-29 17:39:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (11519 resets) in 2827 ms. (353 steps per ms)
BEST_FIRST walk for 2000001 steps (3727 resets) in 2688 ms. (743 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:39:25] [INFO ] Invariant cache hit.
[2025-05-29 17:39:25] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2025-05-29 17:39:25] [INFO ] [Real]Absence check using 40 positive and 122 generalized place invariants in 31 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-05-29 17:39:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Nat]Absence check using 40 positive and 122 generalized place invariants in 25 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-05-29 17:39:26] [INFO ] Computed and/alt/rep : 611/2329/611 causal constraints (skipped 907 transitions) in 76 ms.
[2025-05-29 17:39:32] [INFO ] Added : 396 causal constraints over 80 iterations in 6201 ms. Result :sat
Minimization took 1614 ms.
[2025-05-29 17:39:34] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2025-05-29 17:39:34] [INFO ] [Real]Absence check using 40 positive and 122 generalized place invariants in 28 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2025-05-29 17:39:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using 40 positive and 122 generalized place invariants in 23 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2025-05-29 17:39:35] [INFO ] Computed and/alt/rep : 611/2329/611 causal constraints (skipped 907 transitions) in 73 ms.
[2025-05-29 17:39:43] [INFO ] Added : 469 causal constraints over 94 iterations in 7838 ms. Result :sat
Minimization took 1599 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1551/1551 transitions.
Applied a total of 0 rules in 29 ms. Remains 923 /923 variables (removed 0) and now considering 1551/1551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 923/923 places, 1551/1551 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1551/1551 transitions.
Applied a total of 0 rules in 26 ms. Remains 923 /923 variables (removed 0) and now considering 1551/1551 (removed 0) transitions.
[2025-05-29 17:39:46] [INFO ] Invariant cache hit.
[2025-05-29 17:39:46] [INFO ] Implicit Places using invariants in 609 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 501, 505, 506, 517, 518, 519, 537, 555, 590, 627, 631, 632, 643, 644, 645, 663, 681, 750, 754, 755, 758, 769, 770, 771, 789, 791, 794, 812, 813, 814, 815, 827, 833, 839, 845, 851, 857, 863, 869, 875, 881, 887]
[2025-05-29 17:39:46] [INFO ] Actually due to overlaps returned [789, 771, 30, 48, 150, 168, 273, 291, 396, 414, 519, 537, 645, 663, 794, 149, 272, 395, 518, 644, 770, 813, 148, 271, 394, 517, 643, 769, 791, 812, 0, 259, 260, 382, 383, 505, 506, 631, 632, 754, 755, 18, 19, 66, 186, 309, 432, 555, 681, 815, 857, 875, 887, 758, 814, 827, 833, 839, 845, 851, 863, 869, 881]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 612 ms to find 63 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 860/923 places, 1551/1551 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 853 transition count 1430
Reduce places removed 121 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 122 rules applied. Total rules applied 250 place count 732 transition count 1429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 251 place count 731 transition count 1429
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 251 place count 731 transition count 1398
Deduced a syphon composed of 31 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 314 place count 699 transition count 1398
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 326 place count 695 transition count 1390
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 334 place count 687 transition count 1390
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 349 place count 672 transition count 1375
Iterating global reduction 5 with 15 rules applied. Total rules applied 364 place count 672 transition count 1375
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 367 place count 672 transition count 1372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 367 place count 672 transition count 1371
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 369 place count 671 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 372 place count 668 transition count 1368
Iterating global reduction 6 with 3 rules applied. Total rules applied 375 place count 668 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 376 place count 667 transition count 1367
Iterating global reduction 6 with 1 rules applied. Total rules applied 377 place count 667 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 378 place count 666 transition count 1366
Iterating global reduction 6 with 1 rules applied. Total rules applied 379 place count 666 transition count 1366
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 485 place count 613 transition count 1313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 491 place count 613 transition count 1307
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 497 place count 607 transition count 1301
Iterating global reduction 7 with 6 rules applied. Total rules applied 503 place count 607 transition count 1301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 509 place count 607 transition count 1295
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 521 place count 607 transition count 1283
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 534 place count 594 transition count 1283
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 553 place count 594 transition count 1283
Applied a total of 553 rules in 221 ms. Remains 594 /860 variables (removed 266) and now considering 1283/1551 (removed 268) transitions.
// Phase 1: matrix 1283 rows 594 cols
[2025-05-29 17:39:47] [INFO ] Computed 86 invariants in 15 ms
[2025-05-29 17:39:47] [INFO ] Implicit Places using invariants in 389 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271, 276, 277, 329, 346, 352, 355, 357, 362, 363, 415, 434, 440, 443, 445, 450, 451, 503, 520, 526, 529, 531]
[2025-05-29 17:39:47] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 450, 105, 191, 277, 363, 451, 89, 95, 100, 101, 174, 180, 185, 260, 266, 271, 346, 352, 357, 434, 440, 445, 520, 526, 531, 72, 157, 243, 329, 415, 503]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 392 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 559/923 places, 1283/1551 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 535 transition count 1259
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 535 transition count 1259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 529 transition count 1253
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 529 transition count 1253
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 84 place count 517 transition count 1241
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 517 transition count 1223
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 120 place count 499 transition count 1223
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 499 transition count 1217
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 493 transition count 1217
Applied a total of 132 rules in 107 ms. Remains 493 /559 variables (removed 66) and now considering 1217/1283 (removed 66) transitions.
// Phase 1: matrix 1217 rows 493 cols
[2025-05-29 17:39:47] [INFO ] Computed 51 invariants in 12 ms
[2025-05-29 17:39:47] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-05-29 17:39:47] [INFO ] Invariant cache hit.
[2025-05-29 17:39:48] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 493/923 places, 1217/1551 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2575 ms. Remains : 493/923 places, 1217/1551 transitions.
[2025-05-29 17:39:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (17795 resets) in 2079 ms. (480 steps per ms)
BEST_FIRST walk for 2000001 steps (7997 resets) in 1513 ms. (1321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:39:52] [INFO ] Invariant cache hit.
[2025-05-29 17:39:52] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:52] [INFO ] [Real]Absence check using 11 positive and 40 generalized place invariants in 10 ms returned sat
[2025-05-29 17:39:52] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-05-29 17:39:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:52] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 11 ms returned sat
[2025-05-29 17:39:53] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2025-05-29 17:39:53] [INFO ] Computed and/alt/rep : 264/1182/264 causal constraints (skipped 923 transitions) in 64 ms.
[2025-05-29 17:39:53] [INFO ] Added : 7 causal constraints over 2 iterations in 326 ms. Result :sat
Minimization took 488 ms.
[2025-05-29 17:39:54] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:54] [INFO ] [Real]Absence check using 11 positive and 40 generalized place invariants in 11 ms returned sat
[2025-05-29 17:39:54] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2025-05-29 17:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:54] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 9 ms returned sat
[2025-05-29 17:39:55] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2025-05-29 17:39:55] [INFO ] Computed and/alt/rep : 264/1182/264 causal constraints (skipped 923 transitions) in 71 ms.
[2025-05-29 17:39:55] [INFO ] Added : 14 causal constraints over 4 iterations in 373 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA ASLink-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 493 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p899) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1216/1216 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 3042 edges and 492 vertex of which 491 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 491 transition count 1215
Applied a total of 2 rules in 21 ms. Remains 491 /493 variables (removed 2) and now considering 1215/1216 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 491/493 places, 1215/1216 transitions.
// Phase 1: matrix 1215 rows 491 cols
[2025-05-29 17:39:56] [INFO ] Computed 50 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (18117 resets) in 2012 ms. (496 steps per ms)
BEST_FIRST walk for 1000001 steps (4060 resets) in 848 ms. (1177 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:39:59] [INFO ] Invariant cache hit.
[2025-05-29 17:39:59] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:39:59] [INFO ] [Real]Absence check using 15 positive and 35 generalized place invariants in 11 ms returned sat
[2025-05-29 17:39:59] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2025-05-29 17:39:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:39:59] [INFO ] [Nat]Absence check using 15 positive and 35 generalized place invariants in 11 ms returned sat
[2025-05-29 17:40:00] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2025-05-29 17:40:00] [INFO ] Computed and/alt/rep : 262/1179/262 causal constraints (skipped 923 transitions) in 59 ms.
[2025-05-29 17:40:00] [INFO ] Added : 48 causal constraints over 10 iterations in 693 ms. Result :sat
Minimization took 1215 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1215/1215 transitions.
Applied a total of 0 rules in 15 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 491/491 places, 1215/1215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1215/1215 transitions.
Applied a total of 0 rules in 15 ms. Remains 491 /491 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
[2025-05-29 17:40:02] [INFO ] Invariant cache hit.
[2025-05-29 17:40:02] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-05-29 17:40:02] [INFO ] Invariant cache hit.
[2025-05-29 17:40:03] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2025-05-29 17:40:03] [INFO ] Redundant transitions in 90 ms returned []
Running 1185 sub problems to find dead transitions.
[2025-05-29 17:40:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 3 (OVERLAPS) 2/491 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
SMT process timed out in 30709ms, After SMT, problems are : Problem set: 0 solved, 1185 unsolved
Search for dead transitions found 0 dead transitions in 30731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32010 ms. Remains : 491/491 places, 1215/1215 transitions.
RANDOM walk for 40000 steps (713 resets) in 1002 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (165 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
[2025-05-29 17:40:34] [INFO ] Flatten gal took : 228 ms
[2025-05-29 17:40:35] [INFO ] Flatten gal took : 104 ms
[2025-05-29 17:40:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16726316595351927624.gal : 41 ms
[2025-05-29 17:40:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10614598888306292977.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/ReachabilityCardinality16726316595351927624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10614598888306292977.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10614598888306292977.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2448 after 109632
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :109632 after 1.09422e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.09422e+06 after 1.1471e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.1471e+06 after 1.15169e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.15169e+06 after 2.21757e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.21757e+06 after 4.6722e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.6722e+07 after 1.41618e+09
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
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,5.70986e+10,2.52211,73460,2,48674,18,168729,6,0,3179,188918,0
Total reachable state count : 57098646807

Verifying 2 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,51792,2.52867,73460,2,5535,18,168729,7,0,3182,188918,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,51792,2.5337,73460,2,5535,18,168729,8,0,3183,188918,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 243306 steps, run timeout after 3005 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 243306 steps, saw 164000 distinct states, run finished after 3015 ms. (steps per millisecond=80 ) properties seen :0
FORMULA ASLink-PT-06a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 167537 ms.

BK_STOP 1748540437881

--------------------
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-06a"
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-06a, 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-174853743000046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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