About the Execution of LTSMin+red for BusinessProcesses-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 410.739 | 43159.00 | 60674.00 | 70.80 | 0 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.r472-tajo-171620399800589.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 ltsminxred
Input is BusinessProcesses-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800589
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 177K 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-18-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717226075273
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:36] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-01 07:14:36] [INFO ] Transformed 717 places.
[2024-06-01 07:14:36] [INFO ] Transformed 642 transitions.
[2024-06-01 07:14:36] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:36] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 627 rows 702 cols
[2024-06-01 07:14:36] [INFO ] Computed 114 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (53 resets) in 73 ms. (135 steps per ms)
FORMULA BusinessProcesses-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (51 resets) in 106 ms. (560 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-01 07:14:37] [INFO ] Invariant cache hit.
[2024-06-01 07:14:37] [INFO ] [Real]Absence check using 73 positive place invariants in 39 ms returned sat
[2024-06-01 07:14:37] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 75 ms returned sat
[2024-06-01 07:14:38] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 33 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:14:38] [INFO ] [Nat]Absence check using 73 positive place invariants in 47 ms returned sat
[2024-06-01 07:14:38] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2024-06-01 07:14:38] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 9 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 6 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 4 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:14:43] [INFO ] [Real]Absence check using 73 positive place invariants in 24 ms returned sat
[2024-06-01 07:14:43] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2024-06-01 07:14:44] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:14:44] [INFO ] [Nat]Absence check using 73 positive place invariants in 38 ms returned sat
[2024-06-01 07:14:44] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 13 ms returned sat
[2024-06-01 07:14:44] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 5 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 132 places in 373 ms of which 33 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 5 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 19 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 6 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 24 places in 320 ms of which 20 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 6 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 18 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 149 places in 318 ms of which 6 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 4 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 4 ms to minimize.
[2024-06-01 07:14:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:14:49] [INFO ] [Real]Absence check using 73 positive place invariants in 32 ms returned sat
[2024-06-01 07:14:49] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2024-06-01 07:14:49] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:14:50] [INFO ] [Nat]Absence check using 73 positive place invariants in 33 ms returned sat
[2024-06-01 07:14:50] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 19 ms returned sat
[2024-06-01 07:14:50] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 5 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 5 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 5 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 5 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 7 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 4 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 4 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 138 places in 239 ms of which 4 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 5 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 4 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 4 ms to minimize.
[2024-06-01 07:14:55] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:14:55] [INFO ] [Real]Absence check using 73 positive place invariants in 33 ms returned sat
[2024-06-01 07:14:55] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2024-06-01 07:14:55] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 4 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:14:56] [INFO ] [Nat]Absence check using 73 positive place invariants in 27 ms returned sat
[2024-06-01 07:14:56] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2024-06-01 07:14:56] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 5 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 4 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 5 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 4 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 130 places in 255 ms of which 4 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 5 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 7 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 5 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 161 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 5 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 4 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 5 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 4 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 170 places in 236 ms of which 5 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 156 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:15:01] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:15:01] [INFO ] [Real]Absence check using 73 positive place invariants in 34 ms returned sat
[2024-06-01 07:15:01] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 13 ms returned sat
[2024-06-01 07:15:01] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 5 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:02] [INFO ] [Nat]Absence check using 73 positive place invariants in 31 ms returned sat
[2024-06-01 07:15:02] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2024-06-01 07:15:02] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 5 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 5 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 5 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 4 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 5 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 4 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 5 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 5 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 4 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 5 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 146 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 4 ms to minimize.
[2024-06-01 07:15:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:15:07] [INFO ] [Real]Absence check using 73 positive place invariants in 34 ms returned sat
[2024-06-01 07:15:07] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2024-06-01 07:15:07] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 5 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:07] [INFO ] [Nat]Absence check using 73 positive place invariants in 30 ms returned sat
[2024-06-01 07:15:07] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2024-06-01 07:15:08] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 5 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 6 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 5 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 154 places in 229 ms of which 5 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 152 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 77 places in 218 ms of which 4 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 4 ms to minimize.
[2024-06-01 07:15:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 406 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 10 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 160 place count 686 transition count 458
Reduce places removed 158 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 163 rules applied. Total rules applied 323 place count 528 transition count 453
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 523 transition count 453
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 328 place count 523 transition count 352
Deduced a syphon composed of 101 places in 3 ms
Ensure Unique test removed 25 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 227 rules applied. Total rules applied 555 place count 397 transition count 352
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 645 place count 307 transition count 262
Iterating global reduction 3 with 90 rules applied. Total rules applied 735 place count 307 transition count 262
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 735 place count 307 transition count 253
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 296 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 756 place count 295 transition count 252
Iterating global reduction 3 with 1 rules applied. Total rules applied 757 place count 295 transition count 252
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 979 place count 184 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 981 place count 183 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 982 place count 183 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 983 place count 182 transition count 143
Applied a total of 983 rules in 256 ms. Remains 182 /702 variables (removed 520) and now considering 143/627 (removed 484) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 182/702 places, 143/627 transitions.
// Phase 1: matrix 143 rows 182 cols
[2024-06-01 07:15:13] [INFO ] Computed 79 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (54777 resets) in 3168 ms. (315 steps per ms)
FORMULA BusinessProcesses-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (28691 resets) in 2037 ms. (490 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 41868 ms.
ITS solved all properties within timeout
BK_STOP 1717226118432
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-18, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.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 ;