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-165463878400064.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-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 6.0K May 30 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 30 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 16K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 30 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 30 14:59 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 5.4M 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-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 1654719991761

Running Version 0
[2022-06-08 20:26:34] [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:26:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:26:35] [INFO ] Load time of PNML (sax parser for PT used): 790 ms
[2022-06-08 20:26:35] [INFO ] Transformed 292 places.
[2022-06-08 20:26:35] [INFO ] Transformed 7108 transitions.
[2022-06-08 20:26:35] [INFO ] Found NUPN structural information;
[2022-06-08 20:26:35] [INFO ] Parsed PT model containing 292 places and 7108 transitions in 939 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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
[2022-06-08 20:26:35] [INFO ] Computed 9 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 324 ms. (steps per millisecond=30 ) 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-12 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-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) 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 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 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 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
[2022-06-08 20:26:36] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2022-06-08 20:26:36] [INFO ] Computed 9 place invariants in 10 ms
[2022-06-08 20:26:36] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-08 20:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:37] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2022-06-08 20:26:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:26:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2022-06-08 20:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:37] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2022-06-08 20:26:37] [INFO ] State equation strengthened by 621 read => feed constraints.
[2022-06-08 20:26:38] [INFO ] [Nat]Added 621 Read/Feed constraints in 311 ms returned sat
[2022-06-08 20:26:38] [INFO ] Deduced a trap composed of 16 places in 527 ms of which 9 ms to minimize.
[2022-06-08 20:26:39] [INFO ] Deduced a trap composed of 16 places in 455 ms of which 4 ms to minimize.
[2022-06-08 20:26:39] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 3 ms to minimize.
[2022-06-08 20:26:40] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2022-06-08 20:26:40] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
[2022-06-08 20:26:40] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2022-06-08 20:26:41] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 1 ms to minimize.
[2022-06-08 20:26:41] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2022-06-08 20:26:41] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2022-06-08 20:26:41] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-06-08 20:26:42] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2022-06-08 20:26:42] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2022-06-08 20:26:42] [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.verifyPossible(DeadlockTester.java:588)
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:26:42] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2022-06-08 20:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:42] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-06-08 20:26:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:26:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-06-08 20:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:43] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-08 20:26:43] [INFO ] [Nat]Added 621 Read/Feed constraints in 316 ms returned sat
[2022-06-08 20:26:44] [INFO ] Deduced a trap composed of 16 places in 345 ms of which 1 ms to minimize.
[2022-06-08 20:26:44] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 1 ms to minimize.
[2022-06-08 20:26:44] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2022-06-08 20:26:45] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 0 ms to minimize.
[2022-06-08 20:26:45] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2022-06-08 20:26:45] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2022-06-08 20:26:45] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2022-06-08 20:26:46] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2022-06-08 20:26:46] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2022-06-08 20:26:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2664 ms
[2022-06-08 20:26:46] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 239 ms.
[2022-06-08 20:26:48] [INFO ] Deduced a trap composed of 2 places in 392 ms of which 1 ms to minimize.
[2022-06-08 20:26:48] [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.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:26:48] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-08 20:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:48] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2022-06-08 20:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:26:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-08 20:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:49] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2022-06-08 20:26:49] [INFO ] [Nat]Added 621 Read/Feed constraints in 258 ms returned sat
[2022-06-08 20:26:49] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 1 ms to minimize.
[2022-06-08 20:26:50] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 1 ms to minimize.
[2022-06-08 20:26:50] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2022-06-08 20:26:51] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2022-06-08 20:26:51] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2022-06-08 20:26:51] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2022-06-08 20:26:51] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2022-06-08 20:26:52] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 0 ms to minimize.
[2022-06-08 20:26:52] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2022-06-08 20:26:52] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2022-06-08 20:26:52] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2022-06-08 20:26:53] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2022-06-08 20:26:53] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-06-08 20:26:53] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2022-06-08 20:26:53] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-06-08 20:26:53] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2022-06-08 20:26:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4347 ms
[2022-06-08 20:26:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
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:26:53] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-08 20:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:54] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-06-08 20:26:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:26:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2022-06-08 20:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:54] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2022-06-08 20:26:54] [INFO ] [Nat]Added 621 Read/Feed constraints in 175 ms returned sat
[2022-06-08 20:26:55] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 1 ms to minimize.
[2022-06-08 20:26:55] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 0 ms to minimize.
[2022-06-08 20:26:55] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 1 ms to minimize.
[2022-06-08 20:26:56] [INFO ] Deduced a trap composed of 18 places in 281 ms of which 1 ms to minimize.
[2022-06-08 20:26:56] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2022-06-08 20:26:56] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2022-06-08 20:26:56] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2022-06-08 20:26:56] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2022-06-08 20:26:57] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2022-06-08 20:26:57] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2022-06-08 20:26:57] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2022-06-08 20:26:57] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2022-06-08 20:26:57] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2022-06-08 20:26:58] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2022-06-08 20:26:58] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-06-08 20:26:58] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-06-08 20:26:58] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-06-08 20:26:58] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2022-06-08 20:26:59] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2022-06-08 20:26:59] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2022-06-08 20:26:59] [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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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:26:59] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-08 20:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:26:59] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-06-08 20:26:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:26:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2022-06-08 20:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:27:00] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-08 20:27:00] [INFO ] [Nat]Added 621 Read/Feed constraints in 241 ms returned sat
[2022-06-08 20:27:00] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 1 ms to minimize.
[2022-06-08 20:27:00] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 1 ms to minimize.
[2022-06-08 20:27:01] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2022-06-08 20:27:01] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2022-06-08 20:27:01] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2022-06-08 20:27:01] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2022-06-08 20:27:02] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2022-06-08 20:27:02] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 4 ms to minimize.
[2022-06-08 20:27:02] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 0 ms to minimize.
[2022-06-08 20:27:02] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2022-06-08 20:27:02] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2022-06-08 20:27:03] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2022-06-08 20:27:03] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2022-06-08 20:27:03] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-06-08 20:27:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3146 ms
[2022-06-08 20:27:03] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 134 ms.
[2022-06-08 20:27:05] [INFO ] Deduced a trap composed of 2 places in 358 ms of which 0 ms to minimize.
[2022-06-08 20:27:05] [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:27:05] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-08 20:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:27:05] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-06-08 20:27:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:27:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-06-08 20:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:27:05] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-06-08 20:27:06] [INFO ] [Nat]Added 621 Read/Feed constraints in 197 ms returned sat
[2022-06-08 20:27:06] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 1 ms to minimize.
[2022-06-08 20:27:06] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 1 ms to minimize.
[2022-06-08 20:27:07] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 1 ms to minimize.
[2022-06-08 20:27:07] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2022-06-08 20:27:07] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2022-06-08 20:27:07] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2022-06-08 20:27:07] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2022-06-08 20:27:08] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2022-06-08 20:27:08] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2022-06-08 20:27:08] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2022-06-08 20:27:08] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2022-06-08 20:27:08] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2022-06-08 20:27:09] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2022-06-08 20:27:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3026 ms
[2022-06-08 20:27:09] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 136 ms.
[2022-06-08 20:27:11] [INFO ] Deduced a trap composed of 2 places in 495 ms of which 2 ms to minimize.
[2022-06-08 20:27:11] [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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 292 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 285 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.14 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 285 transition count 813
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 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 83 rules applied. Total rules applied 154 place count 240 transition count 775
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 164 place count 232 transition count 773
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 166 place count 230 transition count 773
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 166 place count 230 transition count 719
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 274 place count 176 transition count 719
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 315 place count 135 transition count 678
Iterating global reduction 4 with 41 rules applied. Total rules applied 356 place count 135 transition count 678
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 397 place count 94 transition count 637
Iterating global reduction 4 with 41 rules applied. Total rules applied 438 place count 94 transition count 637
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Iterating post reduction 4 with 263 rules applied. Total rules applied 701 place count 94 transition count 374
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 710 place count 85 transition count 365
Iterating global reduction 5 with 9 rules applied. Total rules applied 719 place count 85 transition count 365
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 725 place count 79 transition count 359
Iterating global reduction 5 with 6 rules applied. Total rules applied 731 place count 79 transition count 359
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 736 place count 79 transition count 354
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 762 place count 66 transition count 341
Drop transitions removed 5 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 772 place count 66 transition count 331
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 779 place count 59 transition count 324
Iterating global reduction 7 with 7 rules applied. Total rules applied 786 place count 59 transition count 324
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 793 place count 52 transition count 317
Iterating global reduction 7 with 7 rules applied. Total rules applied 800 place count 52 transition count 317
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 807 place count 45 transition count 310
Iterating global reduction 7 with 7 rules applied. Total rules applied 814 place count 45 transition count 310
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 819 place count 45 transition count 305
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 825 place count 45 transition count 305
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 828 place count 45 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 829 place count 44 transition count 301
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 4 rules applied. Total rules applied 833 place count 43 transition count 298
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 836 place count 40 transition count 298
Performed 13 Post agglomeration using F-continuation condition with reduction of 245 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 862 place count 27 transition count 40
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 870 place count 27 transition count 32
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 13 rules applied. Total rules applied 883 place count 19 transition count 27
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 888 place count 19 transition count 22
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 891 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 892 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 893 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 894 place count 16 transition count 16
Applied a total of 894 rules in 363 ms. Remains 16 /292 variables (removed 276) and now considering 16/890 (removed 874) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/292 places, 16/890 transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-06-08 20:27:11] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 33223 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 6) seen :6
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654720033372

--------------------
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-07a"
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-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 r305-smll-165463878400064"
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 ;