Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r455-smll-167912647400485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is StigmergyCommit-PT-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647400485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.2K Feb 26 11:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 11:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:23 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 StigmergyCommit-PT-07b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-07b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679259262511

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=StigmergyCommit-PT-07b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 20:54:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 20:54:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:54:26] [INFO ] Load time of PNML (sax parser for PT used): 1173 ms
[2023-03-19 20:54:26] [INFO ] Transformed 2443 places.
[2023-03-19 20:54:26] [INFO ] Transformed 15956 transitions.
[2023-03-19 20:54:26] [INFO ] Found NUPN structural information;
[2023-03-19 20:54:26] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 1449 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 15956 rows 2443 cols
[2023-03-19 20:54:27] [INFO ] Computed 9 place invariants in 677 ms
Incomplete random walk after 10000 steps, including 66 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 16) seen :3
FORMULA StigmergyCommit-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
[2023-03-19 20:54:28] [INFO ] Invariant cache hit.
[2023-03-19 20:54:29] [INFO ] [Real]Absence check using 9 positive place invariants in 74 ms returned sat
[2023-03-19 20:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:54:33] [INFO ] [Real]Absence check using state equation in 3941 ms returned unknown
[2023-03-19 20:54:34] [INFO ] [Real]Absence check using 9 positive place invariants in 66 ms returned sat
[2023-03-19 20:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:54:38] [INFO ] [Real]Absence check using state equation in 4204 ms returned unknown
[2023-03-19 20:54:39] [INFO ] [Real]Absence check using 9 positive place invariants in 63 ms returned sat
[2023-03-19 20:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:54: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
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-19 20:54:44] [INFO ] [Real]Absence check using 9 positive place invariants in 65 ms returned sat
[2023-03-19 20:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:54:48] [INFO ] [Real]Absence check using state equation in 4241 ms returned unknown
[2023-03-19 20:54:49] [INFO ] [Real]Absence check using 9 positive place invariants in 67 ms returned sat
[2023-03-19 20:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:54:53] [INFO ] [Real]Absence check using state equation in 4427 ms returned unknown
[2023-03-19 20:54:54] [INFO ] [Real]Absence check using 9 positive place invariants in 62 ms returned sat
[2023-03-19 20:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:54:58] [INFO ] [Real]Absence check using state equation in 4438 ms returned unknown
[2023-03-19 20:54:59] [INFO ] [Real]Absence check using 9 positive place invariants in 64 ms returned sat
[2023-03-19 20:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:03] [INFO ] [Real]Absence check using state equation in 4312 ms returned unknown
[2023-03-19 20:55:04] [INFO ] [Real]Absence check using 9 positive place invariants in 83 ms returned sat
[2023-03-19 20:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:08] [INFO ] [Real]Absence check using state equation in 4466 ms returned unknown
[2023-03-19 20:55:09] [INFO ] [Real]Absence check using 9 positive place invariants in 66 ms returned sat
[2023-03-19 20:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:13] [INFO ] [Real]Absence check using state equation in 4448 ms returned unknown
[2023-03-19 20:55:14] [INFO ] [Real]Absence check using 9 positive place invariants in 62 ms returned sat
[2023-03-19 20:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:18] [INFO ] [Real]Absence check using state equation in 4466 ms returned unknown
[2023-03-19 20:55:19] [INFO ] [Real]Absence check using 9 positive place invariants in 95 ms returned sat
[2023-03-19 20:55:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:23] [INFO ] [Real]Absence check using state equation in 4412 ms returned unknown
[2023-03-19 20:55:24] [INFO ] [Real]Absence check using 9 positive place invariants in 99 ms returned sat
[2023-03-19 20:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:28] [INFO ] [Real]Absence check using state equation in 4375 ms returned unknown
[2023-03-19 20:55:29] [INFO ] [Real]Absence check using 9 positive place invariants in 89 ms returned sat
[2023-03-19 20:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:33] [INFO ] [Real]Absence check using state equation in 4236 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 2443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2402 edges and 2443 vertex of which 165 / 2443 are part of one of the 23 SCC in 27 ms
Free SCC test removed 142 places
Drop transitions removed 181 transitions
Reduce isomorphic transitions removed 181 transitions.
Graph (complete) has 3976 edges and 2301 vertex of which 2287 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.120 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1817 transitions
Trivial Post-agglo rules discarded 1817 transitions
Performed 1817 trivial Post agglomeration. Transition count delta: 1817
Iterating post reduction 0 with 1824 rules applied. Total rules applied 1826 place count 2287 transition count 13944
Reduce places removed 1817 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 1878 rules applied. Total rules applied 3704 place count 470 transition count 13883
Reduce places removed 23 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 33 rules applied. Total rules applied 3737 place count 447 transition count 13873
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 3747 place count 437 transition count 13873
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 3747 place count 437 transition count 13789
Deduced a syphon composed of 84 places in 9 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 3915 place count 353 transition count 13789
Discarding 93 places :
Symmetric choice reduction at 4 with 93 rule applications. Total rules 4008 place count 260 transition count 13696
Iterating global reduction 4 with 93 rules applied. Total rules applied 4101 place count 260 transition count 13696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4101 place count 260 transition count 13695
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4103 place count 259 transition count 13695
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 4152 place count 210 transition count 1037
Iterating global reduction 4 with 49 rules applied. Total rules applied 4201 place count 210 transition count 1037
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 4222 place count 210 transition count 1016
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 4235 place count 197 transition count 1003
Iterating global reduction 5 with 13 rules applied. Total rules applied 4248 place count 197 transition count 1003
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 4261 place count 184 transition count 990
Iterating global reduction 5 with 13 rules applied. Total rules applied 4274 place count 184 transition count 990
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4285 place count 184 transition count 979
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 4335 place count 159 transition count 954
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4336 place count 159 transition count 953
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4344 place count 151 transition count 945
Iterating global reduction 7 with 8 rules applied. Total rules applied 4352 place count 151 transition count 945
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4359 place count 144 transition count 938
Iterating global reduction 7 with 7 rules applied. Total rules applied 4366 place count 144 transition count 938
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4373 place count 137 transition count 931
Iterating global reduction 7 with 7 rules applied. Total rules applied 4380 place count 137 transition count 931
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 4386 place count 134 transition count 946
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 4387 place count 134 transition count 945
Free-agglomeration rule applied 51 times.
Iterating global reduction 7 with 51 rules applied. Total rules applied 4438 place count 134 transition count 894
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 7 with 180 rules applied. Total rules applied 4618 place count 83 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4626 place count 75 transition count 757
Iterating global reduction 8 with 8 rules applied. Total rules applied 4634 place count 75 transition count 757
Drop transitions removed 265 transitions
Redundant transition composition rules discarded 265 transitions
Iterating global reduction 8 with 265 rules applied. Total rules applied 4899 place count 75 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4901 place count 74 transition count 491
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4904 place count 74 transition count 488
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 4907 place count 71 transition count 488
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 4916 place count 71 transition count 488
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 4922 place count 71 transition count 482
Applied a total of 4922 rules in 4344 ms. Remains 71 /2443 variables (removed 2372) and now considering 482/15956 (removed 15474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4345 ms. Remains : 71/2443 places, 482/15956 transitions.
// Phase 1: matrix 482 rows 71 cols
[2023-03-19 20:55:38] [INFO ] Computed 9 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 13) seen :12
FORMULA StigmergyCommit-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 1) seen :1
FORMULA StigmergyCommit-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 74864 ms.
ITS solved all properties within timeout

BK_STOP 1679259341217

--------------------
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="StigmergyCommit-PT-07b"
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 StigmergyCommit-PT-07b, 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 r455-smll-167912647400485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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