Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208600441.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is DES-PT-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208600441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 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

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716337339054

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 00:22:20] [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]
[2024-05-22 00:22:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:22:20] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-22 00:22:20] [INFO ] Transformed 399 places.
[2024-05-22 00:22:20] [INFO ] Transformed 350 transitions.
[2024-05-22 00:22:20] [INFO ] Found NUPN structural information;
[2024-05-22 00:22:20] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 350 rows 399 cols
[2024-05-22 00:22:20] [INFO ] Computed 65 invariants in 35 ms
Incomplete random walk after 10000 steps, including 85 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :12
FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
[2024-05-22 00:22:20] [INFO ] Invariant cache hit.
[2024-05-22 00:22:21] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-05-22 00:22:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-22 00:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:21] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-22 00:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2024-05-22 00:22:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-22 00:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:21] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-05-22 00:22:21] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 5 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:22:22] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1576 ms
[2024-05-22 00:22:23] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 31 ms.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-22 00:22:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-22 00:22:26] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2024-05-22 00:22:26] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-22 00:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:26] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-22 00:22:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2024-05-22 00:22:27] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 82 ms returned sat
[2024-05-22 00:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:27] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 0 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2024-05-22 00:22:27] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 18 ms.
[2024-05-22 00:22:29] [INFO ] Added : 231 causal constraints over 47 iterations in 1680 ms. Result :sat
Minimization took 113 ms.
[2024-05-22 00:22:29] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2024-05-22 00:22:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-22 00:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:29] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-22 00:22:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2024-05-22 00:22:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2024-05-22 00:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:30] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 626 ms
[2024-05-22 00:22:30] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 17 ms.
[2024-05-22 00:22:32] [INFO ] Added : 234 causal constraints over 47 iterations in 1959 ms. Result :sat
Minimization took 115 ms.
[2024-05-22 00:22:32] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2024-05-22 00:22:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-22 00:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:33] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-22 00:22:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2024-05-22 00:22:33] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 74 ms returned sat
[2024-05-22 00:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:33] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1033 ms
[2024-05-22 00:22:34] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 19 ms.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2024-05-22 00:22:36] [INFO ] Added : 309 causal constraints over 62 iterations in 2106 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 388 transition count 322
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 367 transition count 322
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 367 transition count 313
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 358 transition count 313
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 339 transition count 294
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 339 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 339 transition count 293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 338 transition count 293
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 323 transition count 278
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 323 transition count 278
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 323 transition count 263
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 321 transition count 262
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 321 transition count 259
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 318 transition count 259
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 241 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 239 transition count 184
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 239 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 238 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 237 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 236 transition count 182
Applied a total of 319 rules in 155 ms. Remains 236 /399 variables (removed 163) and now considering 182/350 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 236/399 places, 182/350 transitions.
// Phase 1: matrix 182 rows 236 cols
[2024-05-22 00:22:38] [INFO ] Computed 60 invariants in 16 ms
Incomplete random walk after 1000000 steps, including 47787 resets, run finished after 1751 ms. (steps per millisecond=571 ) properties (out of 4) seen :2
FORMULA DES-PT-30b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9100 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9106 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 2) seen :0
[2024-05-22 00:22:41] [INFO ] Invariant cache hit.
[2024-05-22 00:22:41] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 00:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:41] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-22 00:22:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2024-05-22 00:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:41] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-22 00:22:41] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:22:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-22 00:22:41] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-22 00:22:42] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:22:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-22 00:22:42] [INFO ] Added : 80 causal constraints over 16 iterations in 356 ms. Result :sat
Minimization took 46 ms.
[2024-05-22 00:22:42] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:42] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-22 00:22:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:42] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-22 00:22:42] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 12 ms.
[2024-05-22 00:22:42] [INFO ] Added : 116 causal constraints over 24 iterations in 313 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 9 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 236/236 places, 182/182 transitions.
[2024-05-22 00:22:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47882 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9031 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9063 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 2) seen :0
[2024-05-22 00:22:46] [INFO ] Invariant cache hit.
[2024-05-22 00:22:46] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-22 00:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:46] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-22 00:22:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 00:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:46] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-22 00:22:47] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 9 ms.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-22 00:22:47] [INFO ] Added : 80 causal constraints over 16 iterations in 353 ms. Result :sat
Minimization took 47 ms.
[2024-05-22 00:22:47] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2024-05-22 00:22:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-22 00:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:47] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-22 00:22:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 40 ms returned sat
[2024-05-22 00:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:47] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-22 00:22:47] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 9 ms.
[2024-05-22 00:22:48] [INFO ] Added : 116 causal constraints over 24 iterations in 328 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-22 00:22:48] [INFO ] Invariant cache hit.
[2024-05-22 00:22:48] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 00:22:48] [INFO ] Invariant cache hit.
[2024-05-22 00:22:48] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-22 00:22:48] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-22 00:22:48] [INFO ] Invariant cache hit.
[2024-05-22 00:22:49] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 236/236 places, 182/182 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-00
[2024-05-22 00:22:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 472 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2024-05-22 00:22:49] [INFO ] Invariant cache hit.
[2024-05-22 00:22:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:22:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 00:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:49] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-22 00:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:22:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 53 ms returned sat
[2024-05-22 00:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:49] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-22 00:22:49] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 8 ms.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-22 00:22:49] [INFO ] Added : 80 causal constraints over 16 iterations in 356 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 236/236 places, 182/182 transitions.
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 48056 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9177 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :0
[2024-05-22 00:22:52] [INFO ] Invariant cache hit.
[2024-05-22 00:22:52] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-22 00:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:52] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 00:22:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:22:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 00:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:52] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-22 00:22:52] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 10 ms.
[2024-05-22 00:22:53] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:22:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-22 00:22:53] [INFO ] Added : 80 causal constraints over 16 iterations in 344 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-22 00:22:53] [INFO ] Invariant cache hit.
[2024-05-22 00:22:53] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 00:22:53] [INFO ] Invariant cache hit.
[2024-05-22 00:22:53] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-22 00:22:53] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-22 00:22:53] [INFO ] Invariant cache hit.
[2024-05-22 00:22:54] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-00 in 4962 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-15
[2024-05-22 00:22:54] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 476 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2024-05-22 00:22:54] [INFO ] Invariant cache hit.
[2024-05-22 00:22:54] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 00:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:54] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-22 00:22:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:22:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 50 ms returned sat
[2024-05-22 00:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:54] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-22 00:22:54] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 10 ms.
[2024-05-22 00:22:54] [INFO ] Added : 116 causal constraints over 24 iterations in 330 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 182
Applied a total of 1 rules in 11 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/236 places, 182/182 transitions.
// Phase 1: matrix 182 rows 236 cols
[2024-05-22 00:22:54] [INFO ] Computed 60 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 47817 resets, run finished after 1664 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9270 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 1) seen :0
[2024-05-22 00:22:57] [INFO ] Invariant cache hit.
[2024-05-22 00:22:57] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 00:22:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 00:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:57] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-22 00:22:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 00:22:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2024-05-22 00:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:57] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-22 00:22:57] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:22:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-22 00:22:57] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 11 ms.
[2024-05-22 00:22:58] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2024-05-22 00:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-22 00:22:58] [INFO ] Added : 147 causal constraints over 30 iterations in 567 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-22 00:22:58] [INFO ] Invariant cache hit.
[2024-05-22 00:22:58] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 00:22:58] [INFO ] Invariant cache hit.
[2024-05-22 00:22:59] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-22 00:22:59] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 00:22:59] [INFO ] Invariant cache hit.
[2024-05-22 00:22:59] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-15 in 5129 ms.
[2024-05-22 00:22:59] [INFO ] Flatten gal took : 53 ms
[2024-05-22 00:22:59] [INFO ] Applying decomposition
[2024-05-22 00:22:59] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13743482053916505507.txt' '-o' '/tmp/graph13743482053916505507.bin' '-w' '/tmp/graph13743482053916505507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13743482053916505507.bin' '-l' '-1' '-v' '-w' '/tmp/graph13743482053916505507.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:59] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:59] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 00:22:59] [INFO ] Flatten gal took : 44 ms
[2024-05-22 00:22:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2024-05-22 00:22:59] [INFO ] Time to serialize gal into /tmp/UpperBounds2888573225865528107.gal : 7 ms
[2024-05-22 00:22:59] [INFO ] Time to serialize properties into /tmp/UpperBounds13048833466733897867.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2888573225865528107.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13048833466733897867.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13048833466733897867.prop.
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\_mod\_flat,2.36867e+13,2.39211,90484,16644,3784,250765,9392,292,187939,278,60194,0
Total reachable state count : 23686708625190

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-00 :0 <= u12.p68 <= 1
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-UpperBounds-00,0,3.01969,91004,1,0,250765,33939,459,187939,372,112113,1827
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-15 :0 <= u2.p107 <= 1
FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-UpperBounds-15,0,3.02279,91004,1,0,250765,33964,478,187939,423,112162,1856
Total runtime 42165 ms.

BK_STOP 1716337383651

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="DES-PT-30b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-30b, 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 r109-tall-171624208600441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;