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.r139-smll-174876533100030.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 MedleyA-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K 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.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 158K 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 MedleyA-PT-18-UpperBounds-00
FORMULA_NAME MedleyA-PT-18-UpperBounds-01
FORMULA_NAME MedleyA-PT-18-UpperBounds-02
FORMULA_NAME MedleyA-PT-18-UpperBounds-03
FORMULA_NAME MedleyA-PT-18-UpperBounds-04
FORMULA_NAME MedleyA-PT-18-UpperBounds-05
FORMULA_NAME MedleyA-PT-18-UpperBounds-06
FORMULA_NAME MedleyA-PT-18-UpperBounds-07
FORMULA_NAME MedleyA-PT-18-UpperBounds-08
FORMULA_NAME MedleyA-PT-18-UpperBounds-09
FORMULA_NAME MedleyA-PT-18-UpperBounds-10
FORMULA_NAME MedleyA-PT-18-UpperBounds-11
FORMULA_NAME MedleyA-PT-18-UpperBounds-12
FORMULA_NAME MedleyA-PT-18-UpperBounds-13
FORMULA_NAME MedleyA-PT-18-UpperBounds-14
FORMULA_NAME MedleyA-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896176301

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:29:38] [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-02 20:29:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:29:39] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2025-06-02 20:29:39] [INFO ] Transformed 252 places.
[2025-06-02 20:29:39] [INFO ] Transformed 543 transitions.
[2025-06-02 20:29:39] [INFO ] Found NUPN structural information;
[2025-06-02 20:29:39] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 541 rows 252 cols
[2025-06-02 20:29:39] [INFO ] Computed 7 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (383 resets) in 113 ms. (87 steps per ms)
FORMULA MedleyA-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (1067 resets) in 333 ms. (359 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2025-06-02 20:29:40] [INFO ] Invariant cache hit.
[2025-06-02 20:29:40] [INFO ] [Real]Absence check using 7 positive place invariants in 40 ms returned sat
[2025-06-02 20:29:41] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2025-06-02 20:29:41] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 18 ms to minimize.
[2025-06-02 20:29:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2025-06-02 20:29:42] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2025-06-02 20:29:42] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 34 ms to minimize.
[2025-06-02 20:29:42] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 4 ms to minimize.
[2025-06-02 20:29:43] [INFO ] Deduced a trap composed of 38 places in 339 ms of which 4 ms to minimize.
[2025-06-02 20:29:43] [INFO ] Deduced a trap composed of 38 places in 358 ms of which 6 ms to minimize.
[2025-06-02 20:29:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1595 ms
[2025-06-02 20:29:43] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 103 ms.
[2025-06-02 20:29:46] [INFO ] Deduced a trap composed of 95 places in 232 ms of which 11 ms to minimize.
[2025-06-02 20:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2025-06-02 20:29:46] [INFO ] Added : 233 causal constraints over 47 iterations in 2713 ms. Result :sat
Minimization took 164 ms.
[2025-06-02 20:29:46] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:29:47] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 20:29:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:29:47] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2025-06-02 20:29:47] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 5 ms to minimize.
[2025-06-02 20:29:48] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:29:48] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 4 ms to minimize.
[2025-06-02 20:29:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 852 ms
[2025-06-02 20:29:48] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 88 ms.
[2025-06-02 20:29:50] [INFO ] Deduced a trap composed of 28 places in 325 ms of which 4 ms to minimize.
[2025-06-02 20:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2025-06-02 20:29:50] [INFO ] Added : 215 causal constraints over 43 iterations in 2678 ms. Result :sat
Minimization took 348 ms.
[2025-06-02 20:29:51] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:29:51] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2025-06-02 20:29:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:29:51] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-06-02 20:29:52] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 3 ms to minimize.
[2025-06-02 20:29:52] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 4 ms to minimize.
[2025-06-02 20:29:52] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 5 ms to minimize.
[2025-06-02 20:29:53] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2025-06-02 20:29:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1088 ms
[2025-06-02 20:29:53] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 44 ms.
[2025-06-02 20:29:54] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 4 ms to minimize.
[2025-06-02 20:29:55] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 4 ms to minimize.
[2025-06-02 20:29:55] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 4 ms to minimize.
[2025-06-02 20:29:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1101 ms
[2025-06-02 20:29:55] [INFO ] Added : 205 causal constraints over 42 iterations in 2786 ms. Result :sat
Minimization took 361 ms.
[2025-06-02 20:29:56] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:29:56] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-02 20:29:56] [INFO ] Deduced a trap composed of 38 places in 333 ms of which 4 ms to minimize.
[2025-06-02 20:29:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:29:57] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-02 20:29:57] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 5 ms to minimize.
[2025-06-02 20:29:58] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 4 ms to minimize.
[2025-06-02 20:29:58] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 4 ms to minimize.
[2025-06-02 20:29:58] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 5 ms to minimize.
[2025-06-02 20:29:59] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 4 ms to minimize.
[2025-06-02 20:29:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1768 ms
[2025-06-02 20:29:59] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 76 ms.
[2025-06-02 20:30:00] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:30:00] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 3 ms to minimize.
[2025-06-02 20:30:00] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 5 ms to minimize.
[2025-06-02 20:30:00] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:30:00] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2025-06-02 20:30:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 944 ms
[2025-06-02 20:30:01] [INFO ] Added : 71 causal constraints over 16 iterations in 1824 ms. Result :sat
Minimization took 249 ms.
[2025-06-02 20:30:01] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-06-02 20:30:01] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-02 20:30:02] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 4 ms to minimize.
[2025-06-02 20:30:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:02] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-06-02 20:30:02] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 4 ms to minimize.
[2025-06-02 20:30:03] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 4 ms to minimize.
[2025-06-02 20:30:03] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 5 ms to minimize.
[2025-06-02 20:30:03] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 4 ms to minimize.
[2025-06-02 20:30:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1343 ms
[2025-06-02 20:30:03] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 62 ms.
[2025-06-02 20:30:06] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 5 ms to minimize.
[2025-06-02 20:30:06] [INFO ] Deduced a trap composed of 41 places in 319 ms of which 6 ms to minimize.
[2025-06-02 20:30:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 805 ms
[2025-06-02 20:30:06] [INFO ] Added : 205 causal constraints over 41 iterations in 2772 ms. Result :sat
Minimization took 332 ms.
[2025-06-02 20:30:07] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:07] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-06-02 20:30:07] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 4 ms to minimize.
[2025-06-02 20:30:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:08] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-06-02 20:30:08] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 8 ms to minimize.
[2025-06-02 20:30:08] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 4 ms to minimize.
[2025-06-02 20:30:09] [INFO ] Deduced a trap composed of 36 places in 324 ms of which 4 ms to minimize.
[2025-06-02 20:30:09] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 4 ms to minimize.
[2025-06-02 20:30:09] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 3 ms to minimize.
[2025-06-02 20:30:10] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 4 ms to minimize.
[2025-06-02 20:30:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1955 ms
[2025-06-02 20:30:10] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 64 ms.
[2025-06-02 20:30:12] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 4 ms to minimize.
[2025-06-02 20:30:12] [INFO ] Deduced a trap composed of 46 places in 361 ms of which 5 ms to minimize.
[2025-06-02 20:30:13] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 4 ms to minimize.
[2025-06-02 20:30:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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-06-02 20:30:13] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:13] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-02 20:30:13] [INFO ] Deduced a trap composed of 46 places in 312 ms of which 5 ms to minimize.
[2025-06-02 20:30:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-06-02 20:30:14] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-02 20:30:14] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 3 ms to minimize.
[2025-06-02 20:30:15] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 3 ms to minimize.
[2025-06-02 20:30:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2025-06-02 20:30:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 724 ms
[2025-06-02 20:30:15] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 62 ms.
[2025-06-02 20:30:18] [INFO ] Deduced a trap composed of 39 places in 321 ms of which 4 ms to minimize.
[2025-06-02 20:30:18] [INFO ] Deduced a trap composed of 144 places in 314 ms of which 4 ms to minimize.
[2025-06-02 20:30:18] [INFO ] Deduced a trap composed of 154 places in 289 ms of which 4 ms to minimize.
[2025-06-02 20:30:19] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1350 ms
Maximisation of solution failed !
Minimization took 2 ms.
[2025-06-02 20:30:19] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:19] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-06-02 20:30:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-06-02 20:30:19] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-06-02 20:30:20] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:30:20] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 4 ms to minimize.
[2025-06-02 20:30:20] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 4 ms to minimize.
[2025-06-02 20:30:21] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2025-06-02 20:30:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1146 ms
[2025-06-02 20:30:21] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 72 ms.
[2025-06-02 20:30:23] [INFO ] Deduced a trap composed of 45 places in 296 ms of which 4 ms to minimize.
[2025-06-02 20:30:24] [INFO ] Deduced a trap composed of 50 places in 272 ms of which 3 ms to minimize.
[2025-06-02 20:30:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 720 ms
[2025-06-02 20:30:24] [INFO ] Added : 226 causal constraints over 46 iterations in 3351 ms. Result :sat
Minimization took 109 ms.
[2025-06-02 20:30:24] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:24] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 20:30:25] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 4 ms to minimize.
[2025-06-02 20:30:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:25] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-06-02 20:30:25] [INFO ] Deduced a trap composed of 37 places in 317 ms of which 4 ms to minimize.
[2025-06-02 20:30:26] [INFO ] Deduced a trap composed of 47 places in 345 ms of which 5 ms to minimize.
[2025-06-02 20:30:26] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 4 ms to minimize.
[2025-06-02 20:30:27] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 4 ms to minimize.
[2025-06-02 20:30:27] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 4 ms to minimize.
[2025-06-02 20:30:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1781 ms
[2025-06-02 20:30:27] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 69 ms.
[2025-06-02 20:30:30] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 3 ms to minimize.
[2025-06-02 20:30:30] [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.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-06-02 20:30:30] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:30] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2025-06-02 20:30:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2025-06-02 20:30:31] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-06-02 20:30:31] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 4 ms to minimize.
[2025-06-02 20:30:31] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 4 ms to minimize.
[2025-06-02 20:30:32] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 4 ms to minimize.
[2025-06-02 20:30:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1006 ms
[2025-06-02 20:30:32] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 66 ms.
[2025-06-02 20:30:35] [INFO ] Deduced a trap composed of 50 places in 311 ms of which 6 ms to minimize.
[2025-06-02 20:30:35] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 4 ms to minimize.
[2025-06-02 20:30:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 777 ms
[2025-06-02 20:30:36] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 5 ms to minimize.
[2025-06-02 20:30:36] [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 9
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-06-02 20:30:36] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-06-02 20:30:36] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2025-06-02 20:30:36] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 4 ms to minimize.
[2025-06-02 20:30:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:37] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2025-06-02 20:30:37] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 5 ms to minimize.
[2025-06-02 20:30:38] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 4 ms to minimize.
[2025-06-02 20:30:38] [INFO ] Deduced a trap composed of 42 places in 324 ms of which 6 ms to minimize.
[2025-06-02 20:30:38] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2025-06-02 20:30:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1229 ms
[2025-06-02 20:30:38] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 68 ms.
[2025-06-02 20:30:41] [INFO ] Added : 234 causal constraints over 48 iterations in 2882 ms. Result :sat
Minimization took 385 ms.
[2025-06-02 20:30:41] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:30:42] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2025-06-02 20:30:42] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 3 ms to minimize.
[2025-06-02 20:30:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:30:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:30:42] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-06-02 20:30:43] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:30:43] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 3 ms to minimize.
[2025-06-02 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2025-06-02 20:30:43] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 68 ms.
[2025-06-02 20:30:46] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 3 ms to minimize.
[2025-06-02 20:30:46] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2025-06-02 20:30:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2025-06-02 20:30:47] [INFO ] Added : 248 causal constraints over 51 iterations in 3550 ms. Result :sat
Minimization took 339 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[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]
FORMULA MedleyA-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 261 edges and 252 vertex of which 13 / 252 are part of one of the 3 SCC in 6 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 242 transition count 482
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 196 transition count 480
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 99 place count 195 transition count 477
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 192 transition count 477
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 102 place count 192 transition count 469
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 118 place count 184 transition count 469
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 159 place count 143 transition count 398
Iterating global reduction 4 with 41 rules applied. Total rules applied 200 place count 143 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 203 place count 143 transition count 395
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 205 place count 141 transition count 395
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 205 place count 141 transition count 389
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 217 place count 135 transition count 389
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 221 place count 131 transition count 357
Iterating global reduction 6 with 4 rules applied. Total rules applied 225 place count 131 transition count 357
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 227 place count 129 transition count 353
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 129 transition count 353
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 261 place count 113 transition count 337
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 265 place count 113 transition count 333
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 305 place count 93 transition count 408
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 309 place count 93 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 311 place count 92 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 319 place count 92 transition count 415
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 327 place count 88 transition count 411
Free-agglomeration rule applied 25 times with reduction of 2 identical transitions.
Iterating global reduction 8 with 25 rules applied. Total rules applied 352 place count 88 transition count 384
Reduce places removed 25 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 53 rules applied. Total rules applied 405 place count 63 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 421 place count 63 transition count 340
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 422 place count 63 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 423 place count 62 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 424 place count 61 transition count 353
Applied a total of 424 rules in 287 ms. Remains 61 /252 variables (removed 191) and now considering 353/541 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 61/252 places, 353/541 transitions.
[2025-06-02 20:30:49] [INFO ] Flow matrix only has 301 transitions (discarded 52 similar events)
// Phase 1: matrix 301 rows 61 cols
[2025-06-02 20:30:49] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (100217 resets) in 3392 ms. (294 steps per ms)
FORMULA MedleyA-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (22784 resets) in 867 ms. (1152 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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-02 20:30:53] [INFO ] Flatten gal took : 117 ms
[2025-06-02 20:30:54] [INFO ] Flatten gal took : 63 ms
[2025-06-02 20:30:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12385224449547876449.gal : 39 ms
[2025-06-02 20:30:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11258642694612916788.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/ReachabilityCardinality12385224449547876449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11258642694612916788.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 75245 ms.

BK_STOP 1748896254235

--------------------
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="MedleyA-PT-18"
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 MedleyA-PT-18, 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 r139-smll-174876533100030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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