Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K May 30 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 30 14:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 7.4K May 30 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 30 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 30 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 12:20 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-06a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654719694032

Running Version 0
[2022-06-08 20:21:37] [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]
[2022-06-08 20:21:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:21:38] [INFO ] Load time of PNML (sax parser for PT used): 631 ms
[2022-06-08 20:21:38] [INFO ] Transformed 256 places.
[2022-06-08 20:21:38] [INFO ] Transformed 2816 transitions.
[2022-06-08 20:21:38] [INFO ] Found NUPN structural information;
[2022-06-08 20:21:38] [INFO ] Parsed PT model containing 256 places and 2816 transitions in 759 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Normalized transition count is 566 out of 587 initially.
// Phase 1: matrix 566 rows 256 cols
[2022-06-08 20:21:38] [INFO ] Computed 8 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 16) seen :8
FORMULA StigmergyCommit-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) 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 8) 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 8) seen :0
[2022-06-08 20:21:38] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2022-06-08 20:21:38] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-08 20:21:39] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:39] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-06-08 20:21:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-08 20:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:39] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2022-06-08 20:21:39] [INFO ] State equation strengthened by 351 read => feed constraints.
[2022-06-08 20:21:39] [INFO ] [Nat]Added 351 Read/Feed constraints in 100 ms returned sat
[2022-06-08 20:21:40] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 5 ms to minimize.
[2022-06-08 20:21:40] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 2 ms to minimize.
[2022-06-08 20:21:40] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 2 ms to minimize.
[2022-06-08 20:21:40] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-06-08 20:21:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2027 ms
[2022-06-08 20:21:42] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 140 ms.
[2022-06-08 20:21:44] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 1 ms to minimize.
[2022-06-08 20:21:44] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 20:21:44] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-08 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:45] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-06-08 20:21:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-08 20:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:45] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2022-06-08 20:21:45] [INFO ] [Nat]Added 351 Read/Feed constraints in 151 ms returned sat
[2022-06-08 20:21:45] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 2 ms to minimize.
[2022-06-08 20:21:46] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2022-06-08 20:21:46] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 0 ms to minimize.
[2022-06-08 20:21:46] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2022-06-08 20:21:46] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2022-06-08 20:21:46] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2022-06-08 20:21:47] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2022-06-08 20:21:47] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2022-06-08 20:21:47] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2022-06-08 20:21:47] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2022-06-08 20:21:47] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2022-06-08 20:21:47] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2022-06-08 20:21:48] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2022-06-08 20:21:48] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-06-08 20:21:48] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2022-06-08 20:21:48] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-06-08 20:21:48] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2022-06-08 20:21:48] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2022-06-08 20:21:48] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3106 ms
[2022-06-08 20:21:48] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 87 ms.
[2022-06-08 20:21:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 20:21:50] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:50] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-06-08 20:21:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-08 20:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:50] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2022-06-08 20:21:50] [INFO ] [Nat]Added 351 Read/Feed constraints in 130 ms returned sat
[2022-06-08 20:21:51] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 1 ms to minimize.
[2022-06-08 20:21:51] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 0 ms to minimize.
[2022-06-08 20:21:51] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2022-06-08 20:21:51] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2022-06-08 20:21:52] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2022-06-08 20:21:53] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-06-08 20:21:53] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2022-06-08 20:21:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2173 ms
[2022-06-08 20:21:53] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 67 ms.
[2022-06-08 20:21:55] [INFO ] Added : 230 causal constraints over 46 iterations in 2376 ms. Result :unknown
[2022-06-08 20:21:55] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 20:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:55] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-06-08 20:21:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 20:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:56] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2022-06-08 20:21:56] [INFO ] [Nat]Added 351 Read/Feed constraints in 82 ms returned sat
[2022-06-08 20:21:56] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2022-06-08 20:21:56] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
[2022-06-08 20:21:56] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2022-06-08 20:21:57] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2022-06-08 20:21:57] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2022-06-08 20:21:57] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-06-08 20:21:57] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2022-06-08 20:21:57] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-06-08 20:21:57] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2022-06-08 20:21:58] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2022-06-08 20:21:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1945 ms
[2022-06-08 20:21:58] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 83 ms.
[2022-06-08 20:22:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 20:22:00] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:01] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2022-06-08 20:22:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:01] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-06-08 20:22:01] [INFO ] [Nat]Added 351 Read/Feed constraints in 128 ms returned sat
[2022-06-08 20:22:01] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2022-06-08 20:22:02] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 0 ms to minimize.
[2022-06-08 20:22:02] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2022-06-08 20:22:02] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-06-08 20:22:02] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2022-06-08 20:22:02] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2022-06-08 20:22:02] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-06-08 20:22:03] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-06-08 20:22:03] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-06-08 20:22:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1554 ms
[2022-06-08 20:22:03] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 83 ms.
[2022-06-08 20:22:06] [INFO ] Deduced a trap composed of 2 places in 303 ms of which 1 ms to minimize.
[2022-06-08 20:22: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: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 20:22:06] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 20:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:06] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-06-08 20:22:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-08 20:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:07] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2022-06-08 20:22:07] [INFO ] [Nat]Added 351 Read/Feed constraints in 150 ms returned sat
[2022-06-08 20:22:07] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2022-06-08 20:22:07] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2022-06-08 20:22:08] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 4 ms to minimize.
[2022-06-08 20:22:08] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2022-06-08 20:22:08] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 10 ms to minimize.
[2022-06-08 20:22:08] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-06-08 20:22:08] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2022-06-08 20:22:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1577 ms
[2022-06-08 20:22:09] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 79 ms.
[2022-06-08 20:22:12] [INFO ] Deduced a trap composed of 2 places in 302 ms of which 0 ms to minimize.
[2022-06-08 20:22:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 20:22:12] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 20:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:12] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-06-08 20:22:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:12] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2022-06-08 20:22:13] [INFO ] [Nat]Added 351 Read/Feed constraints in 142 ms returned sat
[2022-06-08 20:22:13] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2022-06-08 20:22:13] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2022-06-08 20:22:13] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2022-06-08 20:22:13] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2022-06-08 20:22:14] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2022-06-08 20:22:14] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2022-06-08 20:22:14] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2022-06-08 20:22:14] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2022-06-08 20:22:14] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-06-08 20:22:14] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2022-06-08 20:22:15] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2022-06-08 20:22:15] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2022-06-08 20:22:15] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2022-06-08 20:22:15] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2022-06-08 20:22:15] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2022-06-08 20:22:15] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-06-08 20:22:15] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-06-08 20:22:16] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-06-08 20:22:16] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3096 ms
[2022-06-08 20:22:16] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 83 ms.
[2022-06-08 20:22:17] [INFO ] Added : 120 causal constraints over 24 iterations in 1432 ms. Result :unknown
[2022-06-08 20:22:17] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:17] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-06-08 20:22:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-06-08 20:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:18] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2022-06-08 20:22:18] [INFO ] [Nat]Added 351 Read/Feed constraints in 130 ms returned sat
[2022-06-08 20:22:18] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 0 ms to minimize.
[2022-06-08 20:22:18] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2022-06-08 20:22:19] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2022-06-08 20:22:19] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2022-06-08 20:22:19] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-06-08 20:22:19] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2022-06-08 20:22:19] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-06-08 20:22:19] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2022-06-08 20:22:19] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2022-06-08 20:22:20] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2022-06-08 20:22:20] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2022-06-08 20:22:20] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-06-08 20:22:20] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2022-06-08 20:22:20] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2022-06-08 20:22:20] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-06-08 20:22:20] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2358 ms
[2022-06-08 20:22:20] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 82 ms.
[2022-06-08 20:22:23] [INFO ] Deduced a trap composed of 2 places in 235 ms of which 1 ms to minimize.
[2022-06-08 20:22:23] [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 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 343300 steps, including 1002 resets, run finished after 4775 ms. (steps per millisecond=71 ) properties (out of 8) seen :8 could not realise parikh vector
FORMULA StigmergyCommit-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654719749084

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-06a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is StigmergyCommit-PT-06a, 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 r305-smll-165463878400058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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