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-171620415000371.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-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 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 189K 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-19-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716651542710

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-19
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:39:04] [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:39:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:39:04] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-25 15:39:04] [INFO ] Transformed 772 places.
[2024-05-25 15:39:04] [INFO ] Transformed 685 transitions.
[2024-05-25 15:39:04] [INFO ] Found NUPN structural information;
[2024-05-25 15:39:04] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
// Phase 1: matrix 670 rows 757 cols
[2024-05-25 15:39:05] [INFO ] Computed 125 invariants in 56 ms
Incomplete random walk after 10000 steps, including 56 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
[2024-05-25 15:39:05] [INFO ] Invariant cache hit.
[2024-05-25 15:39:05] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2024-05-25 15:39:05] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2024-05-25 15:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:05] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-05-25 15:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:06] [INFO ] [Nat]Absence check using 78 positive place invariants in 42 ms returned sat
[2024-05-25 15:39:06] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2024-05-25 15:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:06] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-25 15:39:06] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 5 ms to minimize.
[2024-05-25 15:39:06] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:39:06] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:39:06] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 8 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:39:07] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 0 ms to minimize.
[2024-05-25 15:39:08] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:39:08] [INFO ] Deduced a trap composed of 128 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:39:08] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:39:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1979 ms
[2024-05-25 15:39:08] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 51 ms.
[2024-05-25 15:39:10] [INFO ] Added : 330 causal constraints over 66 iterations in 2252 ms. Result :sat
Minimization took 143 ms.
[2024-05-25 15:39:10] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-25 15:39:10] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2024-05-25 15:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:11] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2024-05-25 15:39:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:11] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-05-25 15:39:11] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2024-05-25 15:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:11] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-25 15:39:11] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:39:13] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:39:13] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2024-05-25 15:39:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1538 ms
[2024-05-25 15:39:13] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 45 ms.
[2024-05-25 15:39:16] [INFO ] Added : 340 causal constraints over 69 iterations in 2970 ms. Result :sat
Minimization took 91 ms.
[2024-05-25 15:39:16] [INFO ] [Real]Absence check using 78 positive place invariants in 47 ms returned sat
[2024-05-25 15:39:16] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 22 ms returned sat
[2024-05-25 15:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:16] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-05-25 15:39:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:17] [INFO ] [Nat]Absence check using 78 positive place invariants in 35 ms returned sat
[2024-05-25 15:39:17] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-25 15:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:17] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-25 15:39:17] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:39:17] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-25 15:39:17] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2024-05-25 15:39:18] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:39:18] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:39:18] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:39:18] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:39:18] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-25 15:39:18] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 5 ms to minimize.
[2024-05-25 15:39:18] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:39:19] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2658 ms
[2024-05-25 15:39:20] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 45 ms.
[2024-05-25 15:39:22] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 1 ms to minimize.
[2024-05-25 15:39: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:39:22] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-25 15:39:22] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-25 15:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:22] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-05-25 15:39:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:22] [INFO ] [Nat]Absence check using 78 positive place invariants in 38 ms returned sat
[2024-05-25 15:39:22] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 20 ms returned sat
[2024-05-25 15:39:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:23] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-25 15:39:23] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:39:23] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2024-05-25 15:39:23] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:39:23] [INFO ] Deduced a trap composed of 153 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 178 places in 148 ms of which 2 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 0 ms to minimize.
[2024-05-25 15:39:24] [INFO ] Deduced a trap composed of 179 places in 148 ms of which 0 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 174 places in 139 ms of which 0 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 176 places in 172 ms of which 8 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 175 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 183 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 160 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 0 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 155 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 2 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 3 ms to minimize.
[2024-05-25 15:39:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4162 ms
[2024-05-25 15:39:27] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 43 ms.
[2024-05-25 15:39:28] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 7 ms to minimize.
[2024-05-25 15:39:28] [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.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:39:28] [INFO ] [Real]Absence check using 78 positive place invariants in 33 ms returned sat
[2024-05-25 15:39:28] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2024-05-25 15:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:28] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2024-05-25 15:39:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:28] [INFO ] [Nat]Absence check using 78 positive place invariants in 60 ms returned sat
[2024-05-25 15:39:28] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-25 15:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:29] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 157 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 155 places in 220 ms of which 1 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:39:29] [INFO ] Deduced a trap composed of 159 places in 154 ms of which 2 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 145 places in 212 ms of which 1 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 0 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 0 ms to minimize.
[2024-05-25 15:39:30] [INFO ] Deduced a trap composed of 148 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 156 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 150 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 155 places in 196 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 0 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 163 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 155 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [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:39:33] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-05-25 15:39:33] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-25 15:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:34] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-05-25 15:39:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:34] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-25 15:39:34] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-25 15:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:34] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2024-05-25 15:39:34] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 1 ms to minimize.
[2024-05-25 15:39:35] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2024-05-25 15:39:35] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2024-05-25 15:39:35] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2024-05-25 15:39:35] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:39:35] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:39:36] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:39:36] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:39:36] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:39:36] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:39:36] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:39:36] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 0 ms to minimize.
[2024-05-25 15:39:36] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3395 ms
[2024-05-25 15:39:38] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 49 ms.
[2024-05-25 15:39:39] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 1 ms to minimize.
[2024-05-25 15:39:39] [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.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:39:39] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2024-05-25 15:39:39] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-25 15:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:39] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-25 15:39:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:40] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-05-25 15:39:40] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2024-05-25 15:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:40] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 153 places in 204 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 2 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 172 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2408 ms
[2024-05-25 15:39:42] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 40 ms.
[2024-05-25 15:39:45] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 1 ms to minimize.
[2024-05-25 15:39:45] [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:39:45] [INFO ] [Real]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-05-25 15:39:45] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2024-05-25 15:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:45] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2024-05-25 15:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:39:45] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-05-25 15:39:45] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2024-05-25 15:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:39:46] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 0 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 1 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 0 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 0 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 0 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 2 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 0 ms to minimize.
[2024-05-25 15:39:50] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:39:50] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:39:50] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:39:50] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 0 ms to minimize.
[2024-05-25 15:39:50] [INFO ] Deduced a trap composed of 169 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:39:50] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 4033 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 430 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 742 transition count 492
Reduce places removed 169 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 172 rules applied. Total rules applied 343 place count 573 transition count 489
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 346 place count 570 transition count 489
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 346 place count 570 transition count 376
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 595 place count 434 transition count 376
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 691 place count 338 transition count 280
Iterating global reduction 3 with 96 rules applied. Total rules applied 787 place count 338 transition count 280
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 787 place count 338 transition count 273
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 801 place count 331 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 802 place count 330 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 803 place count 330 transition count 272
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1045 place count 208 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1047 place count 207 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1049 place count 207 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1051 place count 205 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1052 place count 205 transition count 153
Applied a total of 1052 rules in 302 ms. Remains 205 /757 variables (removed 552) and now considering 153/670 (removed 517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 205/757 places, 153/670 transitions.
// Phase 1: matrix 153 rows 205 cols
[2024-05-25 15:39:51] [INFO ] Computed 92 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 46253 resets, run finished after 3697 ms. (steps per millisecond=270 ) properties (out of 8) seen :8
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 50346 ms.

BK_STOP 1716651595251

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.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-19"
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-19, 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-171620415000371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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