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.r069-smll-174854075900043.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 DES-PT-40b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K 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.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 115K 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 DES-PT-40b-UpperBounds-00
FORMULA_NAME DES-PT-40b-UpperBounds-01
FORMULA_NAME DES-PT-40b-UpperBounds-02
FORMULA_NAME DES-PT-40b-UpperBounds-03
FORMULA_NAME DES-PT-40b-UpperBounds-04
FORMULA_NAME DES-PT-40b-UpperBounds-05
FORMULA_NAME DES-PT-40b-UpperBounds-06
FORMULA_NAME DES-PT-40b-UpperBounds-07
FORMULA_NAME DES-PT-40b-UpperBounds-08
FORMULA_NAME DES-PT-40b-UpperBounds-09
FORMULA_NAME DES-PT-40b-UpperBounds-10
FORMULA_NAME DES-PT-40b-UpperBounds-11
FORMULA_NAME DES-PT-40b-UpperBounds-12
FORMULA_NAME DES-PT-40b-UpperBounds-13
FORMULA_NAME DES-PT-40b-UpperBounds-14
FORMULA_NAME DES-PT-40b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748604286143

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:24:48] [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-30 11:24:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:24:48] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2025-05-30 11:24:48] [INFO ] Transformed 439 places.
[2025-05-30 11:24:48] [INFO ] Transformed 390 transitions.
[2025-05-30 11:24:48] [INFO ] Found NUPN structural information;
[2025-05-30 11:24:48] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 390 rows 439 cols
[2025-05-30 11:24:48] [INFO ] Computed 65 invariants in 44 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 (82 resets) in 97 ms. (102 steps per ms)
FORMULA DES-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (56 resets) in 101 ms. (490 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-30 11:24:48] [INFO ] Invariant cache hit.
[2025-05-30 11:24:49] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2025-05-30 11:24:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2025-05-30 11:24:49] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2025-05-30 11:24:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:24:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 39 ms returned sat
[2025-05-30 11:24:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2025-05-30 11:24:50] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-05-30 11:24:51] [INFO ] Deduced a trap composed of 32 places in 387 ms of which 35 ms to minimize.
[2025-05-30 11:24:51] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 21 ms to minimize.
[2025-05-30 11:24:51] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 4 ms to minimize.
[2025-05-30 11:24:51] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 4 ms to minimize.
[2025-05-30 11:24:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1124 ms
[2025-05-30 11:24:51] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 65 ms.
[2025-05-30 11:24:54] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 4 ms to minimize.
[2025-05-30 11:24:54] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 4 ms to minimize.
[2025-05-30 11:24:54] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 4 ms to minimize.
[2025-05-30 11:24:55] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 4 ms to minimize.
[2025-05-30 11:24:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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-30 11:24:55] [INFO ] [Real]Absence check using 39 positive place invariants in 26 ms returned sat
[2025-05-30 11:24:55] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2025-05-30 11:24:55] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2025-05-30 11:24:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:24:55] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2025-05-30 11:24:55] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2025-05-30 11:24:56] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-05-30 11:24:56] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 5 ms to minimize.
[2025-05-30 11:24:56] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 4 ms to minimize.
[2025-05-30 11:24:56] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 4 ms to minimize.
[2025-05-30 11:24:57] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 4 ms to minimize.
[2025-05-30 11:24:57] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 4 ms to minimize.
[2025-05-30 11:24:57] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 4 ms to minimize.
[2025-05-30 11:24:57] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 3 ms to minimize.
[2025-05-30 11:24:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1510 ms
[2025-05-30 11:24:57] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 35 ms.
[2025-05-30 11:25:00] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 4 ms to minimize.
[2025-05-30 11:25:00] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 4 ms to minimize.
[2025-05-30 11:25:00] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 4 ms to minimize.
[2025-05-30 11:25:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2025-05-30 11:25:00] [INFO ] Added : 278 causal constraints over 57 iterations in 2877 ms. Result :sat
Minimization took 152 ms.
[2025-05-30 11:25:00] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2025-05-30 11:25:00] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 29 ms returned sat
[2025-05-30 11:25:01] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2025-05-30 11:25:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:25:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2025-05-30 11:25:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2025-05-30 11:25:01] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2025-05-30 11:25:01] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 4 ms to minimize.
[2025-05-30 11:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-05-30 11:25:01] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 32 ms.
[2025-05-30 11:25:04] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 3 ms to minimize.
[2025-05-30 11:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-05-30 11:25:04] [INFO ] Added : 249 causal constraints over 50 iterations in 2476 ms. Result :sat
Minimization took 440 ms.
[2025-05-30 11:25:04] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2025-05-30 11:25:05] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2025-05-30 11:25:05] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-05-30 11:25:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:25:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 23 ms returned sat
[2025-05-30 11:25:05] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2025-05-30 11:25:05] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2025-05-30 11:25:06] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 4 ms to minimize.
[2025-05-30 11:25:06] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 4 ms to minimize.
[2025-05-30 11:25:06] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 3 ms to minimize.
[2025-05-30 11:25:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 748 ms
[2025-05-30 11:25:06] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 34 ms.
[2025-05-30 11:25:09] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2025-05-30 11:25:10] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2025-05-30 11:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2025-05-30 11:25:10] [INFO ] Added : 329 causal constraints over 67 iterations in 3766 ms. Result :unknown
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 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 428 transition count 362
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 407 transition count 362
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 407 transition count 353
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 398 transition count 353
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 379 transition count 334
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 379 transition count 334
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 379 transition count 333
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 378 transition count 333
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 363 transition count 318
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 363 transition count 318
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 363 transition count 303
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 361 transition count 302
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 361 transition count 299
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 358 transition count 299
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 281 transition count 222
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 279 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 279 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 278 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 278 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 277 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 276 transition count 222
Applied a total of 320 rules in 303 ms. Remains 276 /439 variables (removed 163) and now considering 222/390 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 276/439 places, 222/390 transitions.
// Phase 1: matrix 222 rows 276 cols
[2025-05-30 11:25:12] [INFO ] Computed 60 invariants in 10 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 (47931 resets) in 2306 ms. (433 steps per ms)
BEST_FIRST walk for 4000004 steps (36554 resets) in 4152 ms. (963 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-30 11:25:18] [INFO ] Invariant cache hit.
[2025-05-30 11:25:18] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-05-30 11:25:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-30 11:25:19] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-05-30 11:25:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:25:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-05-30 11:25:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-30 11:25:19] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-30 11:25:19] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 6 ms to minimize.
[2025-05-30 11:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2025-05-30 11:25:19] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 46 ms.
[2025-05-30 11:25:20] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2025-05-30 11:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2025-05-30 11:25:20] [INFO ] Added : 69 causal constraints over 14 iterations in 795 ms. Result :sat
Minimization took 170 ms.
[2025-05-30 11:25:20] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:25:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2025-05-30 11:25:20] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-05-30 11:25:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:25:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2025-05-30 11:25:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-30 11:25:21] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-05-30 11:25:21] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 16 ms.
[2025-05-30 11:25:21] [INFO ] Added : 101 causal constraints over 21 iterations in 490 ms. Result :sat
Minimization took 122 ms.
[2025-05-30 11:25:21] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2025-05-30 11:25:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-30 11:25:22] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2025-05-30 11:25:22] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 52 ms.
[2025-05-30 11:25:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:25:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-30 11:25:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-30 11:25:22] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-05-30 11:25:22] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 17 ms.
[2025-05-30 11:25:23] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 5 ms to minimize.
[2025-05-30 11:25:23] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2025-05-30 11:25:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2025-05-30 11:25:23] [INFO ] Added : 118 causal constraints over 24 iterations in 715 ms. Result :sat
Minimization took 120 ms.
[2025-05-30 11:25:23] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-30 11:25:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-30 11:25:23] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-05-30 11:25:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:25:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-30 11:25:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:25:23] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-05-30 11:25:23] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 16 ms.
[2025-05-30 11:25:24] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2025-05-30 11:25:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-05-30 11:25:25] [INFO ] Added : 202 causal constraints over 41 iterations in 1142 ms. Result :sat
Minimization took 138 ms.
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 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 12 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 12 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-05-30 11:25:26] [INFO ] Invariant cache hit.
[2025-05-30 11:25:26] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-05-30 11:25:26] [INFO ] Invariant cache hit.
[2025-05-30 11:25:27] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2025-05-30 11:25:27] [INFO ] Redundant transitions in 17 ms returned []
Running 219 sub problems to find dead transitions.
[2025-05-30 11:25:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 222/497 variables, 275/335 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2025-05-30 11:25:36] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-05-30 11:25:36] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/498 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2025-05-30 11:25:44] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
[2025-05-30 11:25:44] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2025-05-30 11:25:49] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2025-05-30 11:25:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2025-05-30 11:25:50] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2025-05-30 11:25:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2025-05-30 11:25:50] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/498 variables, and 345 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 222/497 variables, 275/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 219/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/498 variables, and 563 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 9/9 constraints]
After SMT, in 60515ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61602 ms. Remains : 276/276 places, 222/222 transitions.
RANDOM walk for 40000 steps (1912 resets) in 2473 ms. (16 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (366 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (386 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (378 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (361 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
[2025-05-30 11:26:28] [INFO ] Flatten gal took : 248 ms
BEST_FIRST walk for 40002 steps (365 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (359 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
[2025-05-30 11:26:28] [INFO ] Flatten gal took : 99 ms
BEST_FIRST walk for 40003 steps (393 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (374 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
[2025-05-30 11:26:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6523327950452497884.gal : 41 ms
[2025-05-30 11:26:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2442611692675873527.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/ReachabilityCardinality6523327950452497884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2442611692675873527.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 ...328
Loading property file /tmp/ReachabilityCardinality2442611692675873527.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 36
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :36 after 40
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :40 after 100
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :100 after 1460
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1460 after 9556
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :9556 after 128488
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :128488 after 207108
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :207108 after 769888
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2.99798e+09 after 2.99813e+09
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :2.99813e+09 after 3.00808e+09
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :2.78314e+10 after 2.78322e+10
Interrupted probabilistic random walk after 483180 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 8
Probabilistic random walk after 483180 steps, saw 67735 distinct states, run finished after 3014 ms. (steps per millisecond=160 ) properties seen :0
[2025-05-30 11:26:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 151/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 13/415 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/417 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 42/459 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 39/498 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 336 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 151/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :7.37836e+10 after 7.51102e+10
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:26:33] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 25/217 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 7/224 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 178/402 variables, 224/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:26:34] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 13/415 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:26:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2025-05-30 11:26:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 2/417 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/417 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 42/459 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/459 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 39/498 variables, 39/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/498 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 0/498 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 348 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2860 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 4518ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :2.54952e+11 after 2.54956e+11
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :3.88918e+11 after 3.93049e+11
Parikh walk visited 0 properties in 7704 ms.
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 12 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 276/276 places, 222/222 transitions.
RANDOM walk for 40000 steps (1872 resets) in 385 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (365 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (364 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (367 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (354 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (327 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (341 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 565765 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 6
Probabilistic random walk after 565765 steps, saw 80012 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2025-05-30 11:26:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 152/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-05-30 11:26:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2025-05-30 11:26:48] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 13/415 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/417 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 42/459 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 39/498 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-05-30 11:26:49] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 3 ms to minimize.
[2025-05-30 11:26:49] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 4 ms to minimize.
[2025-05-30 11:26:49] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/498 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 341 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2259 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 152/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/224 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 178/402 variables, 224/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 13/415 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-05-30 11:26:50] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 2/417 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/417 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 42/459 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/459 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/459 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 39/498 variables, 39/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/498 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/498 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 348 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 3850ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :7.71388e+11 after 7.716e+11
Parikh walk visited 0 properties in 4954 ms.
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 10 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 10 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-05-30 11:26:56] [INFO ] Invariant cache hit.
[2025-05-30 11:26:56] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-30 11:26:56] [INFO ] Invariant cache hit.
[2025-05-30 11:26:57] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2025-05-30 11:26:57] [INFO ] Redundant transitions in 20 ms returned []
Running 219 sub problems to find dead transitions.
[2025-05-30 11:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 222/497 variables, 275/335 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2025-05-30 11:27:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2025-05-30 11:27:03] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/498 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2025-05-30 11:27:09] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2025-05-30 11:27:09] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :1.81568e+12 after 1.82424e+12
[2025-05-30 11:27:13] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2025-05-30 11:27:14] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2025-05-30 11:27:15] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 12 ms to minimize.
[2025-05-30 11:27:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2025-05-30 11:27:15] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Detected timeout of ITS tools.
[2025-05-30 11:27:19] [INFO ] Flatten gal took : 37 ms
[2025-05-30 11:27:19] [INFO ] Applying decomposition
[2025-05-30 11:27:19] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1593100985316094440.txt' '-o' '/tmp/graph1593100985316094440.bin' '-w' '/tmp/graph1593100985316094440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1593100985316094440.bin' '-l' '-1' '-v' '-w' '/tmp/graph1593100985316094440.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:27:19] [INFO ] Decomposing Gal with order
[2025-05-30 11:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:27:19] [INFO ] Removed a total of 46 redundant transitions.
[2025-05-30 11:27:19] [INFO ] Flatten gal took : 80 ms
[2025-05-30 11:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 13 ms.
[2025-05-30 11:27:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4733509586153524670.gal : 10 ms
[2025-05-30 11:27:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality223193715888098592.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4733509586153524670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality223193715888098592.prop' '--nowitness'

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 ...306
Loading property file /tmp/ReachabilityCardinality223193715888098592.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 516
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :516 after 48952
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :48952 after 5.3459e+08
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :5.3459e+08 after 1.54938e+09
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.54938e+09 after 2.56417e+09
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.56417e+09 after 4.18783e+09
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4.18783e+09 after 1.15564e+10
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.60306e+13 after 2.65386e+13
At refinement iteration 13 (OVERLAPS) 0/498 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 345 constraints, problems are : Problem set: 0 solved, 219 unsolved in 27160 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
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,4.28367e+13,6.72479,156796,26342,6018,414989,15667,273,368550,378,114845,0
Total reachable state count : 42836683042352

Verifying 4 reachability properties.
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1776,6.75899,156796,54,243,414989,15667,275,368550,381,114845,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1776,6.76499,156796,54,243,414989,15667,279,368550,383,114845,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,4736,6.77126,156796,63,259,414989,15667,279,368550,384,114845,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,4736,6.77806,156796,63,259,414989,15667,281,368550,385,114845,0
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 222/497 variables, 275/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 219/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/498 variables, and 563 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 9/9 constraints]
After SMT, in 57375ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 57379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58102 ms. Remains : 276/276 places, 222/222 transitions.
FORMULA DES-PT-40b-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40b-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 186445 ms.

BK_STOP 1748604474566

--------------------
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="DES-PT-40b"
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 DES-PT-40b, 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 r069-smll-174854075900043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;