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.r237-smll-174903502600011.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 StigmergyCommit-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502600011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 5.4M May 29 14:33 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 StigmergyCommit-PT-07a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106518369

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:55:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 06:55:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:55:21] [INFO ] Load time of PNML (sax parser for PT used): 905 ms
[2025-06-05 06:55:21] [INFO ] Transformed 292 places.
[2025-06-05 06:55:21] [INFO ] Transformed 7108 transitions.
[2025-06-05 06:55:21] [INFO ] Found NUPN structural information;
[2025-06-05 06:55:21] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 1198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 06:55:22] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2025-06-05 06:55:22] [INFO ] Computed 9 invariants in 39 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 (3 resets) in 444 ms. (22 steps per ms)
FORMULA StigmergyCommit-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (19 resets) in 133 ms. (671 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 06:55:22] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
[2025-06-05 06:55:22] [INFO ] Invariant cache hit.
[2025-06-05 06:55:23] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-06-05 06:55:23] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2025-06-05 06:55:24] [INFO ] State equation strengthened by 621 read => feed constraints.
[2025-06-05 06:55:24] [INFO ] [Real]Added 621 Read/Feed constraints in 246 ms returned sat
[2025-06-05 06:55:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-06-05 06:55:24] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2025-06-05 06:55:25] [INFO ] [Nat]Added 621 Read/Feed constraints in 170 ms returned sat
[2025-06-05 06:55:25] [INFO ] Deduced a trap composed of 19 places in 486 ms of which 35 ms to minimize.
[2025-06-05 06:55:26] [INFO ] Deduced a trap composed of 16 places in 486 ms of which 5 ms to minimize.
[2025-06-05 06:55:26] [INFO ] Deduced a trap composed of 16 places in 478 ms of which 13 ms to minimize.
[2025-06-05 06:55:27] [INFO ] Deduced a trap composed of 18 places in 390 ms of which 5 ms to minimize.
[2025-06-05 06:55:27] [INFO ] Deduced a trap composed of 16 places in 330 ms of which 4 ms to minimize.
[2025-06-05 06:55:27] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 4 ms to minimize.
[2025-06-05 06:55:28] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 4 ms to minimize.
[2025-06-05 06:55:28] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 4 ms to minimize.
[2025-06-05 06:55:28] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 2 ms to minimize.
[2025-06-05 06:55:29] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 3 ms to minimize.
[2025-06-05 06:55:29] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 2 ms to minimize.
[2025-06-05 06:55:29] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 4316 ms
[2025-06-05 06:55:29] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-06-05 06:55:29] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2025-06-05 06:55:30] [INFO ] [Real]Added 621 Read/Feed constraints in 242 ms returned sat
[2025-06-05 06:55:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-06-05 06:55:30] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2025-06-05 06:55:31] [INFO ] [Nat]Added 621 Read/Feed constraints in 268 ms returned sat
[2025-06-05 06:55:31] [INFO ] Deduced a trap composed of 17 places in 556 ms of which 5 ms to minimize.
[2025-06-05 06:55:32] [INFO ] Deduced a trap composed of 18 places in 401 ms of which 4 ms to minimize.
[2025-06-05 06:55:32] [INFO ] Deduced a trap composed of 17 places in 342 ms of which 4 ms to minimize.
[2025-06-05 06:55:32] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 3 ms to minimize.
[2025-06-05 06:55:33] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 3 ms to minimize.
[2025-06-05 06:55:33] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 3 ms to minimize.
[2025-06-05 06:55:33] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 2 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 3 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 2 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2025-06-05 06:55:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3886 ms
[2025-06-05 06:55:35] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 231 ms.
[2025-06-05 06:55:35] [INFO ] Added : 5 causal constraints over 1 iterations in 319 ms. Result :unknown
[2025-06-05 06:55:35] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-06-05 06:55:35] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-06-05 06:55:36] [INFO ] [Real]Added 621 Read/Feed constraints in 170 ms returned sat
[2025-06-05 06:55:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-06-05 06:55:36] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2025-06-05 06:55:36] [INFO ] [Nat]Added 621 Read/Feed constraints in 320 ms returned sat
[2025-06-05 06:55:37] [INFO ] Deduced a trap composed of 19 places in 526 ms of which 5 ms to minimize.
[2025-06-05 06:55:38] [INFO ] Deduced a trap composed of 16 places in 535 ms of which 4 ms to minimize.
[2025-06-05 06:55:38] [INFO ] Deduced a trap composed of 19 places in 422 ms of which 4 ms to minimize.
[2025-06-05 06:55:38] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 4 ms to minimize.
[2025-06-05 06:55:39] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 3 ms to minimize.
[2025-06-05 06:55:39] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 5 ms to minimize.
[2025-06-05 06:55:40] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2025-06-05 06:55:40] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 3 ms to minimize.
[2025-06-05 06:55:40] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 4 ms to minimize.
[2025-06-05 06:55:41] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 3 ms to minimize.
[2025-06-05 06:55:41] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 3 ms to minimize.
[2025-06-05 06:55:41] [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 2
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.verifyPossible(DeadlockTester.java:868)
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-05 06:55:41] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-06-05 06:55:41] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-06-05 06:55:41] [INFO ] [Real]Added 621 Read/Feed constraints in 172 ms returned sat
[2025-06-05 06:55:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-06-05 06:55:42] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-06-05 06:55:42] [INFO ] [Nat]Added 621 Read/Feed constraints in 233 ms returned sat
[2025-06-05 06:55:43] [INFO ] Deduced a trap composed of 17 places in 431 ms of which 10 ms to minimize.
[2025-06-05 06:55:43] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 4 ms to minimize.
[2025-06-05 06:55:44] [INFO ] Deduced a trap composed of 17 places in 434 ms of which 4 ms to minimize.
[2025-06-05 06:55:44] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 3 ms to minimize.
[2025-06-05 06:55:44] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 3 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 5 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 2 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 3 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4234 ms
[2025-06-05 06:55:47] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 113 ms.
[2025-06-05 06:55:47] [INFO ] Added : 0 causal constraints over 0 iterations in 114 ms. Result :unknown
[2025-06-05 06:55:47] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2025-06-05 06:55:47] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2025-06-05 06:55:47] [INFO ] [Real]Added 621 Read/Feed constraints in 119 ms returned sat
[2025-06-05 06:55:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-06-05 06:55:47] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2025-06-05 06:55:48] [INFO ] [Nat]Added 621 Read/Feed constraints in 159 ms returned sat
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 4 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 3 ms to minimize.
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 19 places in 383 ms of which 4 ms to minimize.
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 4 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 3 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 3 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 3 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3205 ms
[2025-06-05 06:55:51] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 139 ms.
[2025-06-05 06:55:52] [INFO ] Added : 59 causal constraints over 12 iterations in 1295 ms. Result :unknown
[2025-06-05 06:55:52] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2025-06-05 06:55:53] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2025-06-05 06:55:53] [INFO ] [Real]Added 621 Read/Feed constraints in 188 ms returned sat
[2025-06-05 06:55:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-06-05 06:55:53] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-05 06:55:54] [INFO ] [Nat]Added 621 Read/Feed constraints in 245 ms returned sat
[2025-06-05 06:55:54] [INFO ] Deduced a trap composed of 16 places in 518 ms of which 4 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 18 places in 493 ms of which 5 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 4 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 17 places in 339 ms of which 4 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 18 places in 449 ms of which 4 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 4 ms to minimize.
[2025-06-05 06:55:57] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 3 ms to minimize.
[2025-06-05 06:55:57] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 3 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 3 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 2 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 2 ms to minimize.
[2025-06-05 06:55:58] [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 5
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.verifyPossible(DeadlockTester.java:868)
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-05 06:55:58] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2025-06-05 06:55:59] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-06-05 06:55:59] [INFO ] [Real]Added 621 Read/Feed constraints in 230 ms returned sat
[2025-06-05 06:55:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-06-05 06:55:59] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-06-05 06:56:00] [INFO ] [Nat]Added 621 Read/Feed constraints in 301 ms returned sat
[2025-06-05 06:56:00] [INFO ] Deduced a trap composed of 19 places in 535 ms of which 5 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 17 places in 374 ms of which 4 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 4 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 2 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 4 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 2 ms to minimize.
[2025-06-05 06:56:03] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2025-06-05 06:56:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3053 ms
[2025-06-05 06:56:03] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 135 ms.
[2025-06-05 06:56:04] [INFO ] Added : 65 causal constraints over 13 iterations in 1158 ms. Result :unknown
[2025-06-05 06:56:04] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-06-05 06:56:04] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2025-06-05 06:56:05] [INFO ] [Real]Added 621 Read/Feed constraints in 201 ms returned sat
[2025-06-05 06:56:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2025-06-05 06:56:05] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-06-05 06:56:05] [INFO ] [Nat]Added 621 Read/Feed constraints in 180 ms returned sat
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 19 places in 446 ms of which 3 ms to minimize.
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 3 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 3 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 5 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 19 places in 451 ms of which 4 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 17 places in 439 ms of which 4 ms to minimize.
[2025-06-05 06:56:09] [INFO ] Deduced a trap composed of 18 places in 350 ms of which 3 ms to minimize.
[2025-06-05 06:56:09] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 3 ms to minimize.
[2025-06-05 06:56:09] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 3 ms to minimize.
[2025-06-05 06:56:09] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2025-06-05 06:56:10] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2025-06-05 06:56:10] [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 7
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.verifyPossible(DeadlockTester.java:868)
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-05 06:56:10] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2025-06-05 06:56:10] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2025-06-05 06:56:10] [INFO ] [Real]Added 621 Read/Feed constraints in 151 ms returned sat
[2025-06-05 06:56:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2025-06-05 06:56:11] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2025-06-05 06:56:11] [INFO ] [Nat]Added 621 Read/Feed constraints in 184 ms returned sat
[2025-06-05 06:56:12] [INFO ] Deduced a trap composed of 17 places in 463 ms of which 3 ms to minimize.
[2025-06-05 06:56:12] [INFO ] Deduced a trap composed of 18 places in 434 ms of which 4 ms to minimize.
[2025-06-05 06:56:12] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 3 ms to minimize.
[2025-06-05 06:56:13] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 4 ms to minimize.
[2025-06-05 06:56:13] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 4 ms to minimize.
[2025-06-05 06:56:14] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 3 ms to minimize.
[2025-06-05 06:56:14] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 4 ms to minimize.
[2025-06-05 06:56:14] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 2 ms to minimize.
[2025-06-05 06:56:14] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2025-06-05 06:56:15] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2025-06-05 06:56:15] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 3 ms to minimize.
[2025-06-05 06:56:15] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 2 ms to minimize.
[2025-06-05 06:56:15] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2025-06-05 06:56:16] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2025-06-05 06:56:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA StigmergyCommit-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.18 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 284 transition count 808
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 89 rules applied. Total rules applied 164 place count 235 transition count 768
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 172 place count 227 transition count 768
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 172 place count 227 transition count 714
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 280 place count 173 transition count 714
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 320 place count 133 transition count 674
Iterating global reduction 3 with 40 rules applied. Total rules applied 360 place count 133 transition count 674
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 400 place count 93 transition count 634
Iterating global reduction 3 with 40 rules applied. Total rules applied 440 place count 93 transition count 634
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Iterating post reduction 3 with 263 rules applied. Total rules applied 703 place count 93 transition count 371
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 710 place count 86 transition count 364
Iterating global reduction 4 with 7 rules applied. Total rules applied 717 place count 86 transition count 364
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 723 place count 80 transition count 358
Iterating global reduction 4 with 6 rules applied. Total rules applied 729 place count 80 transition count 358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 734 place count 80 transition count 353
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 766 place count 64 transition count 337
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 782 place count 64 transition count 321
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 789 place count 57 transition count 314
Iterating global reduction 6 with 7 rules applied. Total rules applied 796 place count 57 transition count 314
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 803 place count 50 transition count 307
Iterating global reduction 6 with 7 rules applied. Total rules applied 810 place count 50 transition count 307
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 817 place count 43 transition count 300
Iterating global reduction 6 with 7 rules applied. Total rules applied 824 place count 43 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 825 place count 42 transition count 299
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 6 with 9 rules applied. Total rules applied 834 place count 41 transition count 291
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 842 place count 33 transition count 291
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 842 place count 33 transition count 289
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 846 place count 31 transition count 289
Performed 9 Post agglomeration using F-continuation condition with reduction of 247 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 864 place count 22 transition count 33
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 872 place count 22 transition count 25
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 21 rules applied. Total rules applied 893 place count 9 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 901 place count 9 transition count 9
Applied a total of 901 rules in 354 ms. Remains 9 /292 variables (removed 283) and now considering 9/890 (removed 881) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 9/292 places, 9/890 transitions.
// Phase 1: matrix 9 rows 9 cols
[2025-06-05 06:56:16] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 590 ms. (1692 steps per ms)
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 366 ms. (2724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 9 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-05 06:56:18] [INFO ] Flatten gal took : 36 ms
[2025-06-05 06:56:18] [INFO ] Flatten gal took : 6 ms
[2025-06-05 06:56:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6826414303371091241.gal : 8 ms
[2025-06-05 06:56:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4423489805110367111.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/ReachabilityCardinality6826414303371091241.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4423489805110367111.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 57613 ms.

BK_STOP 1749106578411

--------------------
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="StigmergyCommit-PT-07a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is StigmergyCommit-PT-07a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r237-smll-174903502600011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07a.tgz
mv StigmergyCommit-PT-07a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;