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.r039-tajo-167813692600501.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 lolaxred
Input is BusinessProcesses-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 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 100K 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-07-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678502121805

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:35:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 02:35:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:35:23] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-11 02:35:23] [INFO ] Transformed 386 places.
[2023-03-11 02:35:23] [INFO ] Transformed 360 transitions.
[2023-03-11 02:35:23] [INFO ] Found NUPN structural information;
[2023-03-11 02:35:23] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 360 rows 386 cols
[2023-03-11 02:35:23] [INFO ] Computed 62 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 109 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :13
FORMULA BusinessProcesses-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
[2023-03-11 02:35:23] [INFO ] Invariant cache hit.
[2023-03-11 02:35:24] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-11 02:35:24] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-11 02:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:24] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-11 02:35:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:35:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-11 02:35:24] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 02:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:24] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-11 02:35:24] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2023-03-11 02:35:24] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:35:24] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:35:24] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-11 02:35:24] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:35:24] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 0 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 106 places in 66 ms of which 1 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 0 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 0 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 0 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 1 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:35:25] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 0 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 1 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 0 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 2 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 1 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 0 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 0 ms to minimize.
[2023-03-11 02:35:26] [INFO ] Deduced a trap composed of 105 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 1 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 3 ms to minimize.
[2023-03-11 02:35:27] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 1 ms to minimize.
[2023-03-11 02:35:28] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:35:28] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 0 ms to minimize.
[2023-03-11 02:35:28] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:35:28] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2023-03-11 02:35:28] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:35:28] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:35:28] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2023-03-11 02:35:29] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:35:29] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:35:29] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 0 ms to minimize.
[2023-03-11 02:35:29] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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)
[2023-03-11 02:35:29] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2023-03-11 02:35:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-11 02:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:29] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-11 02:35:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:35:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-11 02:35:29] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-11 02:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:29] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-11 02:35:29] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:35:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 862 ms
[2023-03-11 02:35:30] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 29 ms.
[2023-03-11 02:35:31] [INFO ] Added : 216 causal constraints over 44 iterations in 1176 ms. Result :sat
Minimization took 107 ms.
[2023-03-11 02:35:32] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2023-03-11 02:35:32] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-11 02:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:32] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-11 02:35:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:35:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-11 02:35:32] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 02:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:32] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-11 02:35:32] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2023-03-11 02:35:32] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-11 02:35:32] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
[2023-03-11 02:35:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-11 02:35:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 375 ms
[2023-03-11 02:35:32] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 30 ms.
[2023-03-11 02:35:33] [INFO ] Added : 173 causal constraints over 35 iterations in 801 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA BusinessProcesses-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 386 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 359/359 transitions.
Graph (trivial) has 216 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 804 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 798 edges and 377 vertex of which 375 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 375 transition count 267
Reduce places removed 82 places and 1 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 167 place count 293 transition count 266
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 167 place count 293 transition count 209
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 290 place count 227 transition count 209
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 335 place count 182 transition count 164
Iterating global reduction 2 with 45 rules applied. Total rules applied 380 place count 182 transition count 164
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 380 place count 182 transition count 158
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 393 place count 175 transition count 158
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 511 place count 115 transition count 100
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 513 place count 114 transition count 103
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 515 place count 114 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 517 place count 112 transition count 101
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 518 place count 112 transition count 101
Applied a total of 518 rules in 97 ms. Remains 112 /386 variables (removed 274) and now considering 101/359 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 112/386 places, 101/359 transitions.
// Phase 1: matrix 101 rows 112 cols
[2023-03-11 02:35:33] [INFO ] Computed 48 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 78455 resets, run finished after 1664 ms. (steps per millisecond=600 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12045 ms.
ITS solved all properties within timeout

BK_STOP 1678502135841

--------------------
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:
++ 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
++ sed s/.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-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-07, 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 r039-tajo-167813692600501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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