Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620415000376.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000376
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:42 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 BusinessProcesses-PT-20-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716651607489

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=BusinessProcesses-PT-20
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:40:09] [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-05-25 15:40:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:40:09] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-25 15:40:09] [INFO ] Transformed 782 places.
[2024-05-25 15:40:09] [INFO ] Transformed 697 transitions.
[2024-05-25 15:40:09] [INFO ] Found NUPN structural information;
[2024-05-25 15:40:09] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 63 places in 15 ms
Reduce places removed 63 places and 59 transitions.
// Phase 1: matrix 638 rows 719 cols
[2024-05-25 15:40:09] [INFO ] Computed 121 invariants in 35 ms
Incomplete random walk after 10000 steps, including 50 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
[2024-05-25 15:40:10] [INFO ] Invariant cache hit.
[2024-05-25 15:40:11] [INFO ] [Real]Absence check using 78 positive place invariants in 128 ms returned sat
[2024-05-25 15:40:11] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-25 15:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:11] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-25 15:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:11] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-05-25 15:40:11] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-25 15:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:11] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 8 places in 334 ms of which 3 ms to minimize.
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 2 ms to minimize.
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 2 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 0 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 1 ms to minimize.
[2024-05-25 15:40:14] [INFO ] Deduced a trap composed of 20 places in 328 ms of which 1 ms to minimize.
[2024-05-25 15:40:14] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 14 ms to minimize.
[2024-05-25 15:40:14] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 2 ms to minimize.
[2024-05-25 15:40:14] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 1 ms to minimize.
[2024-05-25 15:40:15] [INFO ] Deduced a trap composed of 158 places in 254 ms of which 14 ms to minimize.
[2024-05-25 15:40:15] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 0 ms to minimize.
[2024-05-25 15:40:15] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 0 ms to minimize.
[2024-05-25 15:40:16] [INFO ] Deduced a trap composed of 153 places in 212 ms of which 1 ms to minimize.
[2024-05-25 15:40:16] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 0 ms to minimize.
[2024-05-25 15:40:16] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 4667 ms
[2024-05-25 15:40:16] [INFO ] [Real]Absence check using 78 positive place invariants in 23 ms returned sat
[2024-05-25 15:40:16] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:16] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-25 15:40:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:17] [INFO ] [Nat]Absence check using 78 positive place invariants in 26 ms returned sat
[2024-05-25 15:40:17] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:17] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-05-25 15:40:17] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:40:17] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2024-05-25 15:40:17] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1846 ms
[2024-05-25 15:40:19] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 33 ms.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 1 ms to minimize.
[2024-05-25 15:40:22] [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-05-25 15:40:22] [INFO ] [Real]Absence check using 78 positive place invariants in 23 ms returned sat
[2024-05-25 15:40:22] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:22] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-25 15:40:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:22] [INFO ] [Nat]Absence check using 78 positive place invariants in 42 ms returned sat
[2024-05-25 15:40:22] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 19 ms returned sat
[2024-05-25 15:40:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:23] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 4 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:40:25] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:40:25] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:40:25] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-05-25 15:40:25] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2024-05-25 15:40:25] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:40:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2547 ms
[2024-05-25 15:40:25] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 38 ms.
[2024-05-25 15:40:27] [INFO ] Added : 300 causal constraints over 60 iterations in 1956 ms. Result :unknown
[2024-05-25 15:40:27] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2024-05-25 15:40:27] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 17 ms returned sat
[2024-05-25 15:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:28] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 155 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:40:29] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 1 ms to minimize.
[2024-05-25 15:40:29] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 5 ms to minimize.
[2024-05-25 15:40:29] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 2 ms to minimize.
[2024-05-25 15:40:29] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2024-05-25 15:40:30] [INFO ] Deduced a trap composed of 149 places in 185 ms of which 4 ms to minimize.
[2024-05-25 15:40:30] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2024-05-25 15:40:30] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 4 ms to minimize.
[2024-05-25 15:40:30] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 1 ms to minimize.
[2024-05-25 15:40:30] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:40:31] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 1 ms to minimize.
[2024-05-25 15:40:31] [INFO ] Deduced a trap composed of 136 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:40:31] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:40:31] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:40:31] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:40:32] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:40:32] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:40:32] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:40:32] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-05-25 15:40:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
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-05-25 15:40:32] [INFO ] [Real]Absence check using 78 positive place invariants in 33 ms returned sat
[2024-05-25 15:40:32] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2024-05-25 15:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:33] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-05-25 15:40:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:33] [INFO ] [Nat]Absence check using 78 positive place invariants in 61 ms returned sat
[2024-05-25 15:40:33] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 18 ms returned sat
[2024-05-25 15:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:33] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 0 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 1 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 1 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 152 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 1 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 169 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 14 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 152 places in 178 ms of which 0 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 152 places in 163 ms of which 0 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [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 4
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.verifyPossible(DeadlockTester.java:919)
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-05-25 15:40:38] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2024-05-25 15:40:38] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-25 15:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:38] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-25 15:40:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:38] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2024-05-25 15:40:38] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:38] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-25 15:40:39] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:40:39] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 0 ms to minimize.
[2024-05-25 15:40:39] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:40:39] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:40:39] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 149 places in 184 ms of which 0 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 0 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 0 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 144 places in 184 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:40:43] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
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-05-25 15:40:43] [INFO ] [Real]Absence check using 78 positive place invariants in 23 ms returned sat
[2024-05-25 15:40:43] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-25 15:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:44] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-05-25 15:40:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:44] [INFO ] [Nat]Absence check using 78 positive place invariants in 24 ms returned sat
[2024-05-25 15:40:44] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2024-05-25 15:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:44] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2605 ms
[2024-05-25 15:40:47] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 35 ms.
[2024-05-25 15:40:49] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 0 ms to minimize.
[2024-05-25 15:40: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 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-05-25 15:40:49] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2024-05-25 15:40:49] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:49] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-25 15:40:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:49] [INFO ] [Nat]Absence check using 78 positive place invariants in 25 ms returned sat
[2024-05-25 15:40:49] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:49] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 0 ms to minimize.
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:40:50] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:40:51] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 13 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-25 15:40:52] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2532 ms
[2024-05-25 15:40:52] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 32 ms.
[2024-05-25 15:40:54] [INFO ] Added : 345 causal constraints over 69 iterations in 2152 ms. Result :unknown
[2024-05-25 15:40:54] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2024-05-25 15:40:54] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-25 15:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:55] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 0 ms to minimize.
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:40:55] [INFO ] Deduced a trap composed of 155 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 0 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 0 ms to minimize.
[2024-05-25 15:40:56] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 0 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 149 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 0 ms to minimize.
[2024-05-25 15:40:57] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 1 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 1 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 1 ms to minimize.
[2024-05-25 15:40:58] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 129 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:40:59] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 0 ms to minimize.
[2024-05-25 15:40:59] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 402 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 686 transition count 456
Reduce places removed 161 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 165 rules applied. Total rules applied 328 place count 525 transition count 452
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 332 place count 521 transition count 452
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 332 place count 521 transition count 349
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 559 place count 397 transition count 349
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 648 place count 308 transition count 260
Iterating global reduction 3 with 89 rules applied. Total rules applied 737 place count 308 transition count 260
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 737 place count 308 transition count 252
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 754 place count 299 transition count 252
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 958 place count 196 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 962 place count 194 transition count 158
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 964 place count 194 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 966 place count 192 transition count 156
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 967 place count 192 transition count 156
Applied a total of 967 rules in 144 ms. Remains 192 /719 variables (removed 527) and now considering 156/638 (removed 482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 192/719 places, 156/638 transitions.
Normalized transition count is 155 out of 156 initially.
// Phase 1: matrix 155 rows 192 cols
[2024-05-25 15:41:00] [INFO ] Computed 83 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 48632 resets, run finished after 3143 ms. (steps per millisecond=318 ) properties (out of 9) seen :9
FORMULA BusinessProcesses-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 54139 ms.

BK_STOP 1716651663869

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BusinessProcesses-PT-20"
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 BusinessProcesses-PT-20, 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 r065-tajo-171620415000376"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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