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

About the Execution of 2024-gold for HexagonalGrid-PT-516

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15687.640 344862.00 396887.00 935.90 12 1 1 12 1 1 12 12 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r125-tall-174876435600006.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 HexagonalGrid-PT-516, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435600006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rwxr-xr-x 1 mcc users 933K 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 HexagonalGrid-PT-516-UpperBounds-00
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-01
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-02
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-03
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-04
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-05
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-06
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-07
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-08
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-09
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-10
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-11
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-12
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-13
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-14
FORMULA_NAME HexagonalGrid-PT-516-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748773792268

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HexagonalGrid-PT-516
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:29:53] [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-06-01 10:29:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:29:53] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2025-06-01 10:29:53] [INFO ] Transformed 1267 places.
[2025-06-01 10:29:53] [INFO ] Transformed 2250 transitions.
[2025-06-01 10:29:53] [INFO ] Parsed PT model containing 1267 places and 2250 transitions and 9000 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2250 rows 1267 cols
[2025-06-01 10:29:54] [INFO ] Computed 482 invariants in 116 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1] Max Struct:[12, 1, 1, 12, 1, 1, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HexagonalGrid-PT-516-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-516-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-516-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-516-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-516-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 704 ms. (14 steps per ms)
FORMULA HexagonalGrid-PT-516-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HexagonalGrid-PT-516-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HexagonalGrid-PT-516-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HexagonalGrid-PT-516-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HexagonalGrid-PT-516-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HexagonalGrid-PT-516-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HexagonalGrid-PT-516-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 6, 3] Max Struct:[12, 12, 12, 12]
[2025-06-01 10:29:55] [INFO ] Invariant cache hit.
[2025-06-01 10:29:55] [INFO ] [Real]Absence check using 481 positive place invariants in 98 ms returned sat
[2025-06-01 10:29:55] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 47 ms returned sat
[2025-06-01 10:29:56] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2025-06-01 10:29:56] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 120 ms.
[2025-06-01 10:30:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:30:00] [INFO ] [Nat]Absence check using 481 positive place invariants in 77 ms returned sat
[2025-06-01 10:30:00] [INFO ] [Nat]Absence check using 481 positive and 1 generalized place invariants in 38 ms returned sat
[2025-06-01 10:30:01] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2025-06-01 10:30:01] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 104 ms.
[2025-06-01 10:30:05] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:30:05] [INFO ] [Real]Absence check using 481 positive place invariants in 66 ms returned sat
[2025-06-01 10:30:05] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 36 ms returned sat
[2025-06-01 10:30:06] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2025-06-01 10:30:06] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 113 ms.
[2025-06-01 10:30:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:30:10] [INFO ] [Nat]Absence check using 481 positive place invariants in 73 ms returned sat
[2025-06-01 10:30:10] [INFO ] [Nat]Absence check using 481 positive and 1 generalized place invariants in 36 ms returned sat
[2025-06-01 10:30:11] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2025-06-01 10:30:11] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 101 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-01 10:30:15] [INFO ] [Real]Absence check using 481 positive place invariants in 65 ms returned sat
[2025-06-01 10:30:15] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 37 ms returned sat
[2025-06-01 10:30:16] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2025-06-01 10:30:16] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 102 ms.
[2025-06-01 10:30:20] [INFO ] Added : 230 causal constraints over 46 iterations in 4172 ms. Result :unknown
[2025-06-01 10:30:20] [INFO ] [Real]Absence check using 481 positive place invariants in 71 ms returned sat
[2025-06-01 10:30:20] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 37 ms returned sat
[2025-06-01 10:30:21] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2025-06-01 10:30:21] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 102 ms.
[2025-06-01 10:30:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 6, 3] Max Struct:[12, 12, 12, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2, 8, 3] Max Struct:[12, 12, 12, 12]
Support contains 4 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 2250/2250 transitions.
Applied a total of 0 rules in 172 ms. Remains 1267 /1267 variables (removed 0) and now considering 2250/2250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1267/1267 places, 2250/2250 transitions.
[2025-06-01 10:30:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 2, 8, 3] Max Struct:[12, 12, 12, 12]
RANDOM walk for 680914 steps (16 resets) in 30001 ms. (22 steps per ms)
FORMULA HexagonalGrid-PT-516-UpperBounds-07 12 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1551157 steps (3 resets) in 15009 ms. (103 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 11, 8] Max Struct:[12, 12, 12]
[2025-06-01 10:31:16] [INFO ] Invariant cache hit.
[2025-06-01 10:31:16] [INFO ] [Real]Absence check using 481 positive place invariants in 72 ms returned sat
[2025-06-01 10:31:16] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 41 ms returned sat
[2025-06-01 10:31:16] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2025-06-01 10:31:17] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 98 ms.
[2025-06-01 10:31:23] [INFO ] Added : 322 causal constraints over 65 iterations in 6298 ms. Result :sat
Minimization took 2024 ms.
[2025-06-01 10:31:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:25] [INFO ] [Nat]Absence check using 481 positive place invariants in 76 ms returned sat
[2025-06-01 10:31:25] [INFO ] [Nat]Absence check using 481 positive and 1 generalized place invariants in 39 ms returned sat
[2025-06-01 10:31:26] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2025-06-01 10:31:26] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 120 ms.
[2025-06-01 10:31:32] [INFO ] Added : 322 causal constraints over 65 iterations in 5759 ms. Result :sat
Minimization took 2104 ms.
[2025-06-01 10:31:34] [INFO ] [Real]Absence check using 481 positive place invariants in 76 ms returned sat
[2025-06-01 10:31:34] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 46 ms returned sat
[2025-06-01 10:31:35] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2025-06-01 10:31:35] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 101 ms.
[2025-06-01 10:31:41] [INFO ] Added : 319 causal constraints over 64 iterations in 6049 ms. Result :sat
Minimization took 2051 ms.
[2025-06-01 10:31:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:43] [INFO ] [Nat]Absence check using 481 positive place invariants in 75 ms returned sat
[2025-06-01 10:31:43] [INFO ] [Nat]Absence check using 481 positive and 1 generalized place invariants in 38 ms returned sat
[2025-06-01 10:31:44] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2025-06-01 10:31:44] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 100 ms.
[2025-06-01 10:31:49] [INFO ] Added : 319 causal constraints over 64 iterations in 5533 ms. Result :sat
Minimization took 2043 ms.
[2025-06-01 10:31:52] [INFO ] [Real]Absence check using 481 positive place invariants in 69 ms returned sat
[2025-06-01 10:31:52] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 36 ms returned sat
[2025-06-01 10:31:52] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2025-06-01 10:31:52] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 96 ms.
[2025-06-01 10:31:58] [INFO ] Added : 301 causal constraints over 61 iterations in 5966 ms. Result :sat
Minimization took 2051 ms.
[2025-06-01 10:32:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:32:01] [INFO ] [Nat]Absence check using 481 positive place invariants in 80 ms returned sat
[2025-06-01 10:32:01] [INFO ] [Nat]Absence check using 481 positive and 1 generalized place invariants in 36 ms returned sat
[2025-06-01 10:32:01] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2025-06-01 10:32:02] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 102 ms.
[2025-06-01 10:32:07] [INFO ] Added : 301 causal constraints over 61 iterations in 5390 ms. Result :sat
Minimization took 2234 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 11, 8] Max Struct:[12, 12, 12]
FORMULA HexagonalGrid-PT-516-UpperBounds-06 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HexagonalGrid-PT-516-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[12]
Support contains 1 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 2250/2250 transitions.
Applied a total of 0 rules in 182 ms. Remains 1267 /1267 variables (removed 0) and now considering 2250/2250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 1267/1267 places, 2250/2250 transitions.
[2025-06-01 10:33:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[12]
RANDOM walk for 665842 steps (15 resets) in 30001 ms. (22 steps per ms)
BEST_FIRST walk for 522429 steps (1 resets) in 5002 ms. (104 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[12]
[2025-06-01 10:33:45] [INFO ] Invariant cache hit.
[2025-06-01 10:33:45] [INFO ] [Real]Absence check using 481 positive place invariants in 69 ms returned sat
[2025-06-01 10:33:45] [INFO ] [Real]Absence check using 481 positive and 1 generalized place invariants in 40 ms returned sat
[2025-06-01 10:33:46] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2025-06-01 10:33:46] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 93 ms.
[2025-06-01 10:33:52] [INFO ] Added : 319 causal constraints over 64 iterations in 5994 ms. Result :sat
Minimization took 2039 ms.
[2025-06-01 10:33:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:33:54] [INFO ] [Nat]Absence check using 481 positive place invariants in 75 ms returned sat
[2025-06-01 10:33:54] [INFO ] [Nat]Absence check using 481 positive and 1 generalized place invariants in 40 ms returned sat
[2025-06-01 10:33:55] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2025-06-01 10:33:55] [INFO ] Computed and/alt/rep : 1884/1884/1884 causal constraints (skipped 0 transitions) in 98 ms.
[2025-06-01 10:34:00] [INFO ] Added : 319 causal constraints over 64 iterations in 5594 ms. Result :sat
Minimization took 2084 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[12]
Support contains 1 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 2250/2250 transitions.
Applied a total of 0 rules in 57 ms. Remains 1267 /1267 variables (removed 0) and now considering 2250/2250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1267/1267 places, 2250/2250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 2250/2250 transitions.
Applied a total of 0 rules in 46 ms. Remains 1267 /1267 variables (removed 0) and now considering 2250/2250 (removed 0) transitions.
[2025-06-01 10:34:25] [INFO ] Invariant cache hit.
[2025-06-01 10:34:26] [INFO ] Implicit Places using invariants in 820 ms returned []
[2025-06-01 10:34:26] [INFO ] Invariant cache hit.
[2025-06-01 10:34:28] [INFO ] Implicit Places using invariants and state equation in 2007 ms returned []
Implicit Place search using SMT with State Equation took 2829 ms to find 0 implicit places.
[2025-06-01 10:34:28] [INFO ] Redundant transitions in 196 ms returned []
Running 1884 sub problems to find dead transitions.
[2025-06-01 10:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1884 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/3517 variables, and 54 constraints, problems are : Problem set: 0 solved, 1884 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 54/481 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1267 constraints, PredecessorRefiner: 1884/1884 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1884 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1884 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1884 unsolved
At refinement iteration 2 (OVERLAPS) 726/1261 variables, 427/481 constraints. Problems are: Problem set: 0 solved, 1884 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1261/3517 variables, and 481 constraints, problems are : Problem set: 0 solved, 1884 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 481/481 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1267 constraints, PredecessorRefiner: 0/1884 constraints, Known Traps: 0/0 constraints]
After SMT, in 61586ms problems are : Problem set: 0 solved, 1884 unsolved
Search for dead transitions found 0 dead transitions in 61618ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64724 ms. Remains : 1267/1267 places, 2250/2250 transitions.
[2025-06-01 10:35:30] [INFO ] Flatten gal took : 394 ms
[2025-06-01 10:35:30] [INFO ] Flatten gal took : 198 ms
[2025-06-01 10:35:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6832825590817010983.gal : 93 ms
[2025-06-01 10:35:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14741312615637089535.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/ReachabilityCardinality6832825590817010983.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14741312615637089535.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8 resets) in 4818 ms. (8 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14741312615637089535.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 727 ms. (54 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 160
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :160 after 1752
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1752 after 759200
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :759200 after 6.51802e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.51802e+06 after 4.11726e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.11726e+07 after 1.03035e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.03035e+08 after 9.89789e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9.89789e+09 after 1.31034e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.31034e+10 after 8.87643e+11
Interrupted probabilistic random walk after 142664 steps, run timeout after 3029 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 142664 steps, saw 142338 distinct states, run finished after 3033 ms. (steps per millisecond=47 ) properties seen :0
[2025-06-01 10:35:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 480/487 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 774/1261 variables, 479/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1261 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/1267 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2250/3517 variables, 1267/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3517 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3517 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3517/3517 variables, and 1749 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 481/481 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1267/1267 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 480/487 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 774/1261 variables, 479/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1261 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/1267 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2250/3517 variables, 1267/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3517 variables, 2/1751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3517 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3517 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3517/3517 variables, and 1751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 481/481 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1267/1267 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2188ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 797 steps, including 0 resets, run visited all 2 properties in 43 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 52 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA HexagonalGrid-PT-516-UpperBounds-03 12 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 343540 ms.

BK_STOP 1748774137130

--------------------
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="HexagonalGrid-PT-516"
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 HexagonalGrid-PT-516, 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 r125-tall-174876435600006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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