Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926500081.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MedleyA-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16: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

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

=== Now, execution of the tool begins

BK_START 1717363072326

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:17:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:17:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:17:55] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-06-02 21:17:55] [INFO ] Transformed 248 places.
[2024-06-02 21:17:55] [INFO ] Transformed 591 transitions.
[2024-06-02 21:17:55] [INFO ] Found NUPN structural information;
[2024-06-02 21:17:55] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
// Phase 1: matrix 589 rows 248 cols
[2024-06-02 21:17:55] [INFO ] Computed 7 invariants in 36 ms
Incomplete random walk after 10000 steps, including 344 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :3
FORMULA MedleyA-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
[2024-06-02 21:17:55] [INFO ] Invariant cache hit.
[2024-06-02 21:17:56] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2024-06-02 21:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:17:56] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-06-02 21:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:17:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-02 21:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:17:56] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 21:17:57] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 5 ms to minimize.
[2024-06-02 21:17:57] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 2 ms to minimize.
[2024-06-02 21:17:57] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 2 ms to minimize.
[2024-06-02 21:17:58] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 1 ms to minimize.
[2024-06-02 21:17:58] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 2 ms to minimize.
[2024-06-02 21:17:58] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2024-06-02 21:17:58] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:17:58] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 1 ms to minimize.
[2024-06-02 21:17:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1844 ms
[2024-06-02 21:17:58] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 82 ms.
[2024-06-02 21:18:00] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 1 ms to minimize.
[2024-06-02 21:18:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2024-06-02 21:18:00] [INFO ] Added : 127 causal constraints over 26 iterations in 1728 ms. Result :sat
Minimization took 175 ms.
[2024-06-02 21:18:00] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:01] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-06-02 21:18:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:01] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-06-02 21:18:02] [INFO ] Deduced a trap composed of 44 places in 705 ms of which 1 ms to minimize.
[2024-06-02 21:18:02] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2024-06-02 21:18:02] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2024-06-02 21:18:02] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 0 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2607 ms
[2024-06-02 21:18:04] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 67 ms.
[2024-06-02 21:18:05] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 2 ms to minimize.
[2024-06-02 21:18:05] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2024-06-02 21:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 924 ms
[2024-06-02 21:18:06] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2024-06-02 21:18:06] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-02 21:18:06] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:06] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-06-02 21:18:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:06] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-06-02 21:18:07] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2024-06-02 21:18:07] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 2 ms to minimize.
[2024-06-02 21:18:07] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2024-06-02 21:18:07] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 0 ms to minimize.
[2024-06-02 21:18:08] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 1 ms to minimize.
[2024-06-02 21:18:08] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 1 ms to minimize.
[2024-06-02 21:18:08] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:18:08] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2024-06-02 21:18:08] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2024-06-02 21:18:09] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2024-06-02 21:18:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2141 ms
[2024-06-02 21:18:09] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 46 ms.
[2024-06-02 21:18:10] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2024-06-02 21:18:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-06-02 21:18:10] [INFO ] Added : 173 causal constraints over 37 iterations in 1948 ms. Result :sat
Minimization took 204 ms.
[2024-06-02 21:18:11] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:11] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-06-02 21:18:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:11] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-06-02 21:18:12] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2024-06-02 21:18:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-06-02 21:18:12] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 45 ms.
[2024-06-02 21:18:12] [INFO ] Added : 19 causal constraints over 4 iterations in 215 ms. Result :sat
Minimization took 67 ms.
[2024-06-02 21:18:12] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:12] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-06-02 21:18:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:12] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-06-02 21:18:13] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 2 ms to minimize.
[2024-06-02 21:18:13] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2024-06-02 21:18:13] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 0 ms to minimize.
[2024-06-02 21:18:13] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2024-06-02 21:18:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1036 ms
[2024-06-02 21:18:14] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 45 ms.
[2024-06-02 21:18:15] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 1 ms to minimize.
[2024-06-02 21:18:15] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 1 ms to minimize.
[2024-06-02 21:18:16] [INFO ] Deduced a trap composed of 115 places in 198 ms of which 1 ms to minimize.
[2024-06-02 21:18:16] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 1 ms to minimize.
[2024-06-02 21:18:16] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2024-06-02 21:18:16] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 0 ms to minimize.
[2024-06-02 21:18:17] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 1 ms to minimize.
[2024-06-02 21:18:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1732 ms
[2024-06-02 21:18:17] [INFO ] Added : 145 causal constraints over 29 iterations in 3170 ms. Result :sat
Minimization took 172 ms.
[2024-06-02 21:18:17] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:17] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-06-02 21:18:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:17] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-02 21:18:18] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2024-06-02 21:18:18] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 1 ms to minimize.
[2024-06-02 21:18:18] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 1 ms to minimize.
[2024-06-02 21:18:18] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2024-06-02 21:18:19] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2024-06-02 21:18:19] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 2 ms to minimize.
[2024-06-02 21:18:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1383 ms
[2024-06-02 21:18:19] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 49 ms.
[2024-06-02 21:18:20] [INFO ] Added : 154 causal constraints over 31 iterations in 1346 ms. Result :sat
Minimization took 162 ms.
[2024-06-02 21:18:20] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:21] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2024-06-02 21:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:21] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 1 ms to minimize.
[2024-06-02 21:18:22] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 1 ms to minimize.
[2024-06-02 21:18:22] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 1 ms to minimize.
[2024-06-02 21:18:22] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2024-06-02 21:18:22] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
[2024-06-02 21:18:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1496 ms
[2024-06-02 21:18:23] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 44 ms.
[2024-06-02 21:18:24] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 2 ms to minimize.
[2024-06-02 21:18:24] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 1 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 1 ms to minimize.
[2024-06-02 21:18:25] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 1 ms to minimize.
[2024-06-02 21:18:26] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1917 ms
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2024-06-02 21:18:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-02 21:18:26] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:26] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-02 21:18:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:27] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-02 21:18:27] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2024-06-02 21:18:27] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 4 ms to minimize.
[2024-06-02 21:18:27] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2024-06-02 21:18:28] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2024-06-02 21:18:28] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 1 ms to minimize.
[2024-06-02 21:18:28] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 0 ms to minimize.
[2024-06-02 21:18:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1434 ms
[2024-06-02 21:18:28] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 48 ms.
[2024-06-02 21:18:29] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:18:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-06-02 21:18:29] [INFO ] Added : 112 causal constraints over 23 iterations in 1287 ms. Result :sat
Minimization took 188 ms.
[2024-06-02 21:18:30] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:30] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-06-02 21:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:30] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 21:18:30] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2024-06-02 21:18:31] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 1 ms to minimize.
[2024-06-02 21:18:31] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2024-06-02 21:18:31] [INFO ] Deduced a trap composed of 105 places in 212 ms of which 1 ms to minimize.
[2024-06-02 21:18:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 978 ms
[2024-06-02 21:18:31] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 48 ms.
[2024-06-02 21:18:34] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2024-06-02 21:18:34] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 0 ms to minimize.
[2024-06-02 21:18:34] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 1 ms to minimize.
[2024-06-02 21:18:34] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 0 ms to minimize.
[2024-06-02 21:18:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1093 ms
[2024-06-02 21:18:35] [INFO ] Added : 185 causal constraints over 37 iterations in 3465 ms. Result :sat
Minimization took 257 ms.
[2024-06-02 21:18:35] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:35] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-06-02 21:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:36] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 21:18:36] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 1 ms to minimize.
[2024-06-02 21:18:36] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 1 ms to minimize.
[2024-06-02 21:18:36] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 1 ms to minimize.
[2024-06-02 21:18:37] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2024-06-02 21:18:37] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 1 ms to minimize.
[2024-06-02 21:18:37] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 1 ms to minimize.
[2024-06-02 21:18:37] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2024-06-02 21:18:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1764 ms
[2024-06-02 21:18:37] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 45 ms.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 1 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 0 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Deduced a trap composed of 103 places in 193 ms of which 1 ms to minimize.
[2024-06-02 21:18:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 809 ms
[2024-06-02 21:18:39] [INFO ] Added : 144 causal constraints over 29 iterations in 2192 ms. Result :sat
Minimization took 195 ms.
[2024-06-02 21:18:40] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 21:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:40] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-06-02 21:18:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 21:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:40] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-06-02 21:18:41] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2024-06-02 21:18:41] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2024-06-02 21:18:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2024-06-02 21:18:41] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 52 ms.
[2024-06-02 21:18:42] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2024-06-02 21:18:42] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 1 ms to minimize.
[2024-06-02 21:18:43] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 0 ms to minimize.
[2024-06-02 21:18:43] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 1 ms to minimize.
[2024-06-02 21:18:43] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 1 ms to minimize.
[2024-06-02 21:18:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1108 ms
[2024-06-02 21:18:43] [INFO ] Added : 177 causal constraints over 36 iterations in 2700 ms. Result :sat
Minimization took 179 ms.
[2024-06-02 21:18:44] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:44] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-02 21:18:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:44] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2024-06-02 21:18:45] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2024-06-02 21:18:45] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2024-06-02 21:18:45] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 0 ms to minimize.
[2024-06-02 21:18:45] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 1 ms to minimize.
[2024-06-02 21:18:45] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 0 ms to minimize.
[2024-06-02 21:18:46] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 1 ms to minimize.
[2024-06-02 21:18:46] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:18:46] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:18:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1464 ms
[2024-06-02 21:18:46] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 47 ms.
[2024-06-02 21:18:47] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2024-06-02 21:18:48] [INFO ] Deduced a trap composed of 118 places in 216 ms of which 1 ms to minimize.
[2024-06-02 21:18:48] [INFO ] Deduced a trap composed of 113 places in 207 ms of which 1 ms to minimize.
[2024-06-02 21:18:48] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 1 ms to minimize.
[2024-06-02 21:18:48] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 0 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 120 places in 149 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 1880 ms
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [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 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-02 21:18:49] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:50] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2024-06-02 21:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 21:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:18:50] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 1 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 1 ms to minimize.
[2024-06-02 21:18:51] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2024-06-02 21:18:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 753 ms
[2024-06-02 21:18:51] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 46 ms.
[2024-06-02 21:18:52] [INFO ] Added : 128 causal constraints over 26 iterations in 1325 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 263 edges and 248 vertex of which 9 / 248 are part of one of the 3 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 242 transition count 548
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 210 transition count 546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 208 transition count 546
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 69 place count 208 transition count 531
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 99 place count 193 transition count 531
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 143 place count 149 transition count 454
Iterating global reduction 3 with 44 rules applied. Total rules applied 187 place count 149 transition count 454
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 219 place count 149 transition count 422
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 219 place count 149 transition count 416
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 231 place count 143 transition count 416
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 142 transition count 400
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 142 transition count 400
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 261 place count 128 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 263 place count 128 transition count 384
Performed 22 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 307 place count 106 transition count 470
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 312 place count 106 transition count 465
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 313 place count 105 transition count 457
Iterating global reduction 6 with 1 rules applied. Total rules applied 314 place count 105 transition count 457
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 318 place count 105 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 320 place count 104 transition count 472
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 336 place count 104 transition count 456
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 7 with 8 rules applied. Total rules applied 344 place count 100 transition count 452
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 375 place count 100 transition count 421
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 34 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 444 place count 69 transition count 383
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 460 place count 69 transition count 367
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 462 place count 69 transition count 395
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 464 place count 67 transition count 395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 465 place count 66 transition count 394
Applied a total of 465 rules in 292 ms. Remains 66 /248 variables (removed 182) and now considering 394/589 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 66/248 places, 394/589 transitions.
Normalized transition count is 318 out of 394 initially.
// Phase 1: matrix 318 rows 66 cols
[2024-06-02 21:18:53] [INFO ] Computed 7 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 83407 resets, run finished after 3995 ms. (steps per millisecond=250 ) properties (out of 11) seen :11
FORMULA MedleyA-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 62862 ms.

BK_STOP 1717363138993

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-17, 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 r597-smll-171734926500081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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