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.r479-smll-167912664100060.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 gold2022
Input is StigmergyCommit-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r479-smll-167912664100060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 5.4K Feb 26 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 15K Feb 26 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:00 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 5.4M 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-07a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679416069942

Running Version 202205111006
[2023-03-21 16:27:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 16:27:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:27:53] [INFO ] Load time of PNML (sax parser for PT used): 1062 ms
[2023-03-21 16:27:53] [INFO ] Transformed 292 places.
[2023-03-21 16:27:53] [INFO ] Transformed 7108 transitions.
[2023-03-21 16:27:53] [INFO ] Found NUPN structural information;
[2023-03-21 16:27:53] [INFO ] Parsed PT model containing 292 places and 7108 transitions in 1357 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 44 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Normalized transition count is 866 out of 890 initially.
// Phase 1: matrix 866 rows 292 cols
[2023-03-21 16:27:54] [INFO ] Computed 9 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 16) seen :10
FORMULA StigmergyCommit-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :1
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
[2023-03-21 16:27:54] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2023-03-21 16:27:54] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-21 16:27:55] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2023-03-21 16:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:27:55] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2023-03-21 16:27:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:27:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 17 ms returned sat
[2023-03-21 16:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:27:56] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2023-03-21 16:27:56] [INFO ] State equation strengthened by 621 read => feed constraints.
[2023-03-21 16:27:56] [INFO ] [Nat]Added 621 Read/Feed constraints in 309 ms returned sat
[2023-03-21 16:27:57] [INFO ] Deduced a trap composed of 16 places in 543 ms of which 10 ms to minimize.
[2023-03-21 16:27:58] [INFO ] Deduced a trap composed of 17 places in 498 ms of which 4 ms to minimize.
[2023-03-21 16:27:58] [INFO ] Deduced a trap composed of 17 places in 437 ms of which 2 ms to minimize.
[2023-03-21 16:27:59] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 4 ms to minimize.
[2023-03-21 16:27:59] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 1 ms to minimize.
[2023-03-21 16:27:59] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-21 16:27:59] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-21 16:28:00] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2023-03-21 16:28:00] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2023-03-21 16:28:00] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-21 16:28:00] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2023-03-21 16:28:01] [INFO ] Deduced a trap composed of 2 places in 502 ms of which 1 ms to minimize.
[2023-03-21 16:28:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-21 16:28:01] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 16:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:01] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2023-03-21 16:28:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:28:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-21 16:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:03] [INFO ] [Nat]Absence check using state equation in 1014 ms returned sat
[2023-03-21 16:28:03] [INFO ] [Nat]Added 621 Read/Feed constraints in 313 ms returned sat
[2023-03-21 16:28:03] [INFO ] Deduced a trap composed of 18 places in 347 ms of which 4 ms to minimize.
[2023-03-21 16:28:04] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 1 ms to minimize.
[2023-03-21 16:28:04] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 1 ms to minimize.
[2023-03-21 16:28:04] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 2 ms to minimize.
[2023-03-21 16:28:05] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2023-03-21 16:28:05] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2023-03-21 16:28:05] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-21 16:28:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2121 ms
[2023-03-21 16:28:05] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 220 ms.
[2023-03-21 16:28:06] [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 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-21 16:28:07] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-21 16:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:07] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2023-03-21 16:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:28:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-21 16:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:07] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2023-03-21 16:28:08] [INFO ] [Nat]Added 621 Read/Feed constraints in 292 ms returned sat
[2023-03-21 16:28:08] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 1 ms to minimize.
[2023-03-21 16:28:09] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 2 ms to minimize.
[2023-03-21 16:28:09] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 1 ms to minimize.
[2023-03-21 16:28:09] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 0 ms to minimize.
[2023-03-21 16:28:10] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 0 ms to minimize.
[2023-03-21 16:28:10] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2023-03-21 16:28:10] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2023-03-21 16:28:11] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 1 ms to minimize.
[2023-03-21 16:28:11] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2023-03-21 16:28:11] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-21 16:28:11] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 2 ms to minimize.
[2023-03-21 16:28:11] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-21 16:28:12] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 1 ms to minimize.
[2023-03-21 16:28:12] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2023-03-21 16:28:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-21 16:28:12] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-21 16:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:12] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-21 16:28:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:28:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-21 16:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:13] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-21 16:28:13] [INFO ] [Nat]Added 621 Read/Feed constraints in 264 ms returned sat
[2023-03-21 16:28:14] [INFO ] Deduced a trap composed of 18 places in 404 ms of which 1 ms to minimize.
[2023-03-21 16:28:14] [INFO ] Deduced a trap composed of 16 places in 372 ms of which 1 ms to minimize.
[2023-03-21 16:28:14] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 1 ms to minimize.
[2023-03-21 16:28:15] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2023-03-21 16:28:15] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2023-03-21 16:28:15] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2023-03-21 16:28:15] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-21 16:28:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2270 ms
[2023-03-21 16:28:16] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 157 ms.
[2023-03-21 16:28:17] [INFO ] Added : 64 causal constraints over 13 iterations in 1429 ms. Result :sat
Minimization took 383 ms.
[2023-03-21 16:28:17] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-21 16:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:18] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-21 16:28:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:28:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-21 16:28:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:28:18] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-21 16:28:19] [INFO ] [Nat]Added 621 Read/Feed constraints in 262 ms returned sat
[2023-03-21 16:28:19] [INFO ] Deduced a trap composed of 16 places in 472 ms of which 2 ms to minimize.
[2023-03-21 16:28:20] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 1 ms to minimize.
[2023-03-21 16:28:20] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 0 ms to minimize.
[2023-03-21 16:28:20] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 1 ms to minimize.
[2023-03-21 16:28:21] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 0 ms to minimize.
[2023-03-21 16:28:21] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2023-03-21 16:28:21] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-21 16:28:21] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2023-03-21 16:28:21] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-21 16:28:22] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2023-03-21 16:28:22] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2023-03-21 16:28:22] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-21 16:28:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3402 ms
[2023-03-21 16:28:22] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 94 ms.
[2023-03-21 16:28:23] [INFO ] Added : 67 causal constraints over 14 iterations in 857 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 292 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.20 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 284 transition count 810
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 86 rules applied. Total rules applied 159 place count 237 transition count 771
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 229 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 228 transition count 770
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 169 place count 228 transition count 716
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 277 place count 174 transition count 716
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 318 place count 133 transition count 675
Iterating global reduction 4 with 41 rules applied. Total rules applied 359 place count 133 transition count 675
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 399 place count 93 transition count 635
Iterating global reduction 4 with 40 rules applied. Total rules applied 439 place count 93 transition count 635
Ensure Unique test removed 262 transitions
Reduce isomorphic transitions removed 262 transitions.
Iterating post reduction 4 with 262 rules applied. Total rules applied 701 place count 93 transition count 373
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 708 place count 86 transition count 366
Iterating global reduction 5 with 7 rules applied. Total rules applied 715 place count 86 transition count 366
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 722 place count 79 transition count 359
Iterating global reduction 5 with 7 rules applied. Total rules applied 729 place count 79 transition count 359
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 735 place count 79 transition count 353
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 763 place count 65 transition count 339
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 775 place count 65 transition count 327
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 782 place count 58 transition count 320
Iterating global reduction 7 with 7 rules applied. Total rules applied 789 place count 58 transition count 320
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 796 place count 51 transition count 313
Iterating global reduction 7 with 7 rules applied. Total rules applied 803 place count 51 transition count 313
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 810 place count 44 transition count 306
Iterating global reduction 7 with 7 rules applied. Total rules applied 817 place count 44 transition count 306
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 820 place count 44 transition count 303
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 824 place count 44 transition count 303
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 826 place count 44 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 827 place count 43 transition count 300
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 7 rules applied. Total rules applied 834 place count 42 transition count 294
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 840 place count 36 transition count 294
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 840 place count 36 transition count 292
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 844 place count 34 transition count 292
Performed 10 Post agglomeration using F-continuation condition with reduction of 246 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 864 place count 24 transition count 36
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 872 place count 24 transition count 28
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 888 place count 14 transition count 22
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 894 place count 14 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 896 place count 14 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 898 place count 12 transition count 12
Applied a total of 898 rules in 453 ms. Remains 12 /292 variables (removed 280) and now considering 12/890 (removed 878) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/292 places, 12/890 transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-21 16:28:23] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 4) seen :4
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32441 ms.

BK_STOP 1679416104975

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-07a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is StigmergyCommit-PT-07a, 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 r479-smll-167912664100060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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