About the Execution of 2023-gold for BusinessProcesses-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 382.888 | 63862.00 | 83084.00 | 73.60 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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-171620414900361.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-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900361
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716651444848
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-17
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:37:26] [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:37:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:37:26] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-25 15:37:26] [INFO ] Transformed 650 places.
[2024-05-25 15:37:26] [INFO ] Transformed 580 transitions.
[2024-05-25 15:37:26] [INFO ] Found NUPN structural information;
[2024-05-25 15:37:26] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 576 rows 646 cols
[2024-05-25 15:37:26] [INFO ] Computed 108 invariants in 29 ms
Incomplete random walk after 10000 steps, including 65 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
[2024-05-25 15:37:27] [INFO ] Invariant cache hit.
[2024-05-25 15:37:27] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-25 15:37:27] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-25 15:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:27] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-25 15:37:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:27] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2024-05-25 15:37:27] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-25 15:37:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:28] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-25 15:37:28] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 3 ms to minimize.
[2024-05-25 15:37:28] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 3 ms to minimize.
[2024-05-25 15:37:28] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2024-05-25 15:37:29] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:37:29] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:37:29] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:37:29] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:37:29] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:37:30] [INFO ] Deduced a trap composed of 124 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:37:30] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:37:30] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:37:30] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:37:30] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:37:30] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:37:31] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:37:31] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 0 ms to minimize.
[2024-05-25 15:37:31] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:37:31] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:37:31] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:37:31] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 0 ms to minimize.
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-05-25 15:37:32] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:37: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 0
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:37:32] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-25 15:37:32] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-25 15:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:33] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2024-05-25 15:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:33] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2024-05-25 15:37:33] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 9 ms returned sat
[2024-05-25 15:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:33] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-25 15:37:33] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:37:33] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:37:34] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:37:35] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 0 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 2 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 7 ms to minimize.
[2024-05-25 15:37:36] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:37:37] [INFO ] Deduced a trap composed of 121 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:37:37] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:37:37] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:37:37] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:37:37] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:37:37] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 1 ms to minimize.
[2024-05-25 15:37:38] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:37:38] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:37: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 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.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:37:38] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-05-25 15:37:38] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-25 15:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:38] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2024-05-25 15:37:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-05-25 15:37:38] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:39] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-05-25 15:37:39] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 0 ms to minimize.
[2024-05-25 15:37:39] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:37:39] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-05-25 15:37:39] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 0 ms to minimize.
[2024-05-25 15:37:40] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 0 ms to minimize.
[2024-05-25 15:37:40] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:37:40] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:37:40] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:37:40] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:37:41] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:37:41] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-05-25 15:37:41] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:37:41] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:37:41] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 2 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 5 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:37:42] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 0 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 0 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:37:43] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:37: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 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.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:37:44] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-25 15:37:44] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:44] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2024-05-25 15:37:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:44] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2024-05-25 15:37:44] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:44] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:37:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1223 ms
[2024-05-25 15:37:46] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 53 ms.
[2024-05-25 15:37:49] [INFO ] Added : 343 causal constraints over 69 iterations in 3330 ms. Result :sat
Minimization took 28 ms.
[2024-05-25 15:37:49] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-25 15:37:49] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:49] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2024-05-25 15:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:49] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2024-05-25 15:37:49] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:50] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 1 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 0 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 0 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 45 places in 381 ms of which 0 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 0 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 148 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 129 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [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:37:55] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2024-05-25 15:37:55] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-25 15:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:55] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2024-05-25 15:37:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:37:55] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-25 15:37:55] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:37:55] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 0 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 0 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 152 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 0 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 142 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:38:00] [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:38:00] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2024-05-25 15:38:00] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-25 15:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:00] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-25 15:38:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:38:00] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2024-05-25 15:38:01] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-25 15:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:01] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3524 ms
[2024-05-25 15:38:04] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 44 ms.
[2024-05-25 15:38:05] [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.refineWithCausalOrder(DeadlockTester.java:1189)
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:38:06] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2024-05-25 15:38:06] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-25 15:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:06] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-25 15:38:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:38:06] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-05-25 15:38:06] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-25 15:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:06] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-05-25 15:38:06] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:38:06] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:38:10] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:38:10] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:38:10] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:38:10] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:38:10] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 153 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 149 places in 142 ms of which 0 ms to minimize.
[2024-05-25 15:38:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:38:11] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2024-05-25 15:38:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2024-05-25 15:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:11] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-05-25 15:38:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:38:11] [INFO ] [Nat]Absence check using 62 positive place invariants in 24 ms returned sat
[2024-05-25 15:38:11] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 9 ms returned sat
[2024-05-25 15:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:11] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-25 15:38:12] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:38:12] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:38:12] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:38:12] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:38:12] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:38:12] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:38:13] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 130 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 147 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:38:14] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 0 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:38:15] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3645 ms
[2024-05-25 15:38:15] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 41 ms.
[2024-05-25 15:38:16] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 0 ms to minimize.
[2024-05-25 15:38:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:38:17] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-25 15:38:17] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-25 15:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:17] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2024-05-25 15:38:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:38:17] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2024-05-25 15:38:17] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 16 ms returned sat
[2024-05-25 15:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:17] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 124 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 0 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:38:20] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:38:20] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 1 ms to minimize.
[2024-05-25 15:38:20] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:38:20] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:38:20] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:38:20] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 0 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3740 ms
[2024-05-25 15:38:21] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 41 ms.
[2024-05-25 15:38:22] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2024-05-25 15:38: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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 358 edges and 646 vertex of which 7 / 646 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 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 636 transition count 429
Reduce places removed 138 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 498 transition count 427
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 282 place count 496 transition count 427
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 282 place count 496 transition count 333
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 488 place count 384 transition count 333
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 567 place count 305 transition count 254
Iterating global reduction 3 with 79 rules applied. Total rules applied 646 place count 305 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 646 place count 305 transition count 246
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 664 place count 295 transition count 246
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 3 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 869 place count 191 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 871 place count 190 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 873 place count 190 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 875 place count 188 transition count 147
Applied a total of 875 rules in 167 ms. Remains 188 /646 variables (removed 458) and now considering 147/576 (removed 429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 188/646 places, 147/576 transitions.
// Phase 1: matrix 147 rows 188 cols
[2024-05-25 15:38:22] [INFO ] Computed 82 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 25029 resets, run finished after 3044 ms. (steps per millisecond=328 ) properties (out of 10) seen :9
FORMULA BusinessProcesses-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 12727 resets, run finished after 1782 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
[2024-05-25 15:38:27] [INFO ] Invariant cache hit.
[2024-05-25 15:38:27] [INFO ] [Real]Absence check using 59 positive place invariants in 23 ms returned sat
[2024-05-25 15:38:27] [INFO ] [Real]Absence check using 59 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-25 15:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:27] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-25 15:38:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-25 15:38:27] [INFO ] [Real]Added 13 Read/Feed constraints in 26 ms returned sat
[2024-05-25 15:38:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:38:28] [INFO ] [Nat]Absence check using 59 positive place invariants in 9 ms returned sat
[2024-05-25 15:38:28] [INFO ] [Nat]Absence check using 59 positive and 23 generalized place invariants in 5 ms returned sat
[2024-05-25 15:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:38:28] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-25 15:38:28] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-25 15:38:28] [INFO ] Computed and/alt/rep : 96/443/96 causal constraints (skipped 49 transitions) in 15 ms.
[2024-05-25 15:38:28] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:38:28] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:38:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2024-05-25 15:38:28] [INFO ] Added : 33 causal constraints over 7 iterations in 329 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA BusinessProcesses-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 61933 ms.
BK_STOP 1716651508710
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-17, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;