Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900589.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r041-tajo-167813694900589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K Mar 5 18:22 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 1678648419308

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:13:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 19:13:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:13:41] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-12 19:13:41] [INFO ] Transformed 717 places.
[2023-03-12 19:13:41] [INFO ] Transformed 642 transitions.
[2023-03-12 19:13:41] [INFO ] Found NUPN structural information;
[2023-03-12 19:13:41] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 15 places in 12 ms
Reduce places removed 15 places and 15 transitions.
// Phase 1: matrix 627 rows 702 cols
[2023-03-12 19:13:41] [INFO ] Computed 114 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 51 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :10
FORMULA BusinessProcesses-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
[2023-03-12 19:13:41] [INFO ] Invariant cache hit.
[2023-03-12 19:13:41] [INFO ] [Real]Absence check using 73 positive place invariants in 28 ms returned sat
[2023-03-12 19:13:41] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2023-03-12 19:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:13:41] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2023-03-12 19:13:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:13:42] [INFO ] [Nat]Absence check using 73 positive place invariants in 24 ms returned sat
[2023-03-12 19:13:42] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 8 ms returned sat
[2023-03-12 19:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:13:42] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2023-03-12 19:13:42] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 5 ms to minimize.
[2023-03-12 19:13:42] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:13:42] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-12 19:13:43] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 2 ms to minimize.
[2023-03-12 19:13:43] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:13:43] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-12 19:13:43] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2023-03-12 19:13:43] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:13:43] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
[2023-03-12 19:13:44] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:13:44] [INFO ] Deduced a trap composed of 159 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:13:44] [INFO ] Deduced a trap composed of 161 places in 129 ms of which 0 ms to minimize.
[2023-03-12 19:13:44] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 1 ms to minimize.
[2023-03-12 19:13:44] [INFO ] Deduced a trap composed of 155 places in 185 ms of which 1 ms to minimize.
[2023-03-12 19:13:44] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:13:45] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 0 ms to minimize.
[2023-03-12 19:13:45] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 2 ms to minimize.
[2023-03-12 19:13:45] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-12 19:13:45] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:13:45] [INFO ] Deduced a trap composed of 169 places in 157 ms of which 2 ms to minimize.
[2023-03-12 19:13:46] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:13:46] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:13:46] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:13:46] [INFO ] Deduced a trap composed of 178 places in 153 ms of which 0 ms to minimize.
[2023-03-12 19:13:46] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 0 ms to minimize.
[2023-03-12 19:13:46] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 4639 ms
[2023-03-12 19:13:47] [INFO ] [Real]Absence check using 73 positive place invariants in 28 ms returned sat
[2023-03-12 19:13:47] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-12 19:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:13:47] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-12 19:13:47] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2023-03-12 19:13:47] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 0 ms to minimize.
[2023-03-12 19:13:47] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-12 19:13:48] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 0 ms to minimize.
[2023-03-12 19:13:48] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 1 ms to minimize.
[2023-03-12 19:13:48] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-12 19:13:48] [INFO ] Deduced a trap composed of 153 places in 182 ms of which 1 ms to minimize.
[2023-03-12 19:13:48] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 0 ms to minimize.
[2023-03-12 19:13:49] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 2 ms to minimize.
[2023-03-12 19:13:49] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2023-03-12 19:13:49] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 0 ms to minimize.
[2023-03-12 19:13:49] [INFO ] Deduced a trap composed of 150 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:13:49] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 1 ms to minimize.
[2023-03-12 19:13:50] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2023-03-12 19:13:50] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 0 ms to minimize.
[2023-03-12 19:13:50] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-12 19:13:50] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 0 ms to minimize.
[2023-03-12 19:13:50] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:13:51] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 1 ms to minimize.
[2023-03-12 19:13:51] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2023-03-12 19:13:51] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:13:51] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 1 ms to minimize.
[2023-03-12 19:13:51] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 1 ms to minimize.
[2023-03-12 19:13:51] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 0 ms to minimize.
[2023-03-12 19:13:51] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-12 19:13:52] [INFO ] [Real]Absence check using 73 positive place invariants in 27 ms returned sat
[2023-03-12 19:13:52] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2023-03-12 19:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:13:52] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-12 19:13:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:13:52] [INFO ] [Nat]Absence check using 73 positive place invariants in 30 ms returned sat
[2023-03-12 19:13:52] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2023-03-12 19:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:13:52] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2023-03-12 19:13:52] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 3 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:13:53] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:13:54] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:13:54] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2023-03-12 19:13:54] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2023-03-12 19:13:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1372 ms
[2023-03-12 19:13:54] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 34 ms.
[2023-03-12 19:13:57] [INFO ] Added : 437 causal constraints over 89 iterations in 3059 ms. Result :sat
Minimization took 135 ms.
[2023-03-12 19:13:57] [INFO ] [Real]Absence check using 73 positive place invariants in 37 ms returned sat
[2023-03-12 19:13:57] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-12 19:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:13:57] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-12 19:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:13:58] [INFO ] [Nat]Absence check using 73 positive place invariants in 31 ms returned sat
[2023-03-12 19:13:58] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2023-03-12 19:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:13:58] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2023-03-12 19:13:58] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:13:58] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-12 19:13:58] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2023-03-12 19:13:58] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2023-03-12 19:13:58] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-12 19:13:58] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 1 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2023-03-12 19:13:59] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2023-03-12 19:14:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1720 ms
[2023-03-12 19:14:00] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 39 ms.
[2023-03-12 19:14:02] [INFO ] Added : 420 causal constraints over 84 iterations in 2826 ms. Result :unknown
[2023-03-12 19:14:03] [INFO ] [Real]Absence check using 73 positive place invariants in 21 ms returned sat
[2023-03-12 19:14:03] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2023-03-12 19:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:14:03] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-12 19:14:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:14:03] [INFO ] [Nat]Absence check using 73 positive place invariants in 29 ms returned sat
[2023-03-12 19:14:03] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2023-03-12 19:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:14:03] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-03-12 19:14:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2023-03-12 19:14:03] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2023-03-12 19:14:03] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-12 19:14:04] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:14:05] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2023-03-12 19:14:05] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2023-03-12 19:14:05] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2023-03-12 19:14:05] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1590 ms
[2023-03-12 19:14:05] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 38 ms.
[2023-03-12 19:14:08] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 1 ms to minimize.
[2023-03-12 19:14:08] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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] Max seen :[0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 412 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions 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.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 686 transition count 453
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 328 place count 523 transition count 453
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 328 place count 523 transition count 348
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 563 place count 393 transition count 348
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 656 place count 300 transition count 255
Iterating global reduction 2 with 93 rules applied. Total rules applied 749 place count 300 transition count 255
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 749 place count 300 transition count 245
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 772 place count 287 transition count 245
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 773 place count 286 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 774 place count 286 transition count 244
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 990 place count 178 transition count 136
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 2 with 2 rules applied. Total rules applied 992 place count 177 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 993 place count 177 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 994 place count 176 transition count 138
Applied a total of 994 rules in 129 ms. Remains 176 /702 variables (removed 526) and now considering 138/627 (removed 489) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 176/702 places, 138/627 transitions.
// Phase 1: matrix 138 rows 176 cols
[2023-03-12 19:14:08] [INFO ] Computed 78 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 55366 resets, run finished after 2843 ms. (steps per millisecond=351 ) properties (out of 2) seen :2
FORMULA BusinessProcesses-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30664 ms.
ITS solved all properties within timeout

BK_STOP 1678648451775

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-5348"
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 r041-tajo-167813694900589"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;