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.r107-smll-165260580300010.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 FlexibleBarrier-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580300010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.8K Apr 29 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K May 10 09:33 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 FlexibleBarrier-PT-06b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652645169856

Running Version 0
[2022-05-15 20:06:13] [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-05-15 20:06:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:06:13] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2022-05-15 20:06:13] [INFO ] Transformed 542 places.
[2022-05-15 20:06:13] [INFO ] Transformed 621 transitions.
[2022-05-15 20:06:13] [INFO ] Found NUPN structural information;
[2022-05-15 20:06:13] [INFO ] Parsed PT model containing 542 places and 621 transitions in 289 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 621 rows 542 cols
[2022-05-15 20:06:13] [INFO ] Computed 8 place invariants in 51 ms
Incomplete random walk after 10000 steps, including 190 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :11
FORMULA FlexibleBarrier-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
// Phase 1: matrix 621 rows 542 cols
[2022-05-15 20:06:13] [INFO ] Computed 8 place invariants in 6 ms
[2022-05-15 20:06:14] [INFO ] [Real]Absence check using 8 positive place invariants in 29 ms returned sat
[2022-05-15 20:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:15] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2022-05-15 20:06:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:06:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2022-05-15 20:06:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:15] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2022-05-15 20:06:16] [INFO ] Deduced a trap composed of 215 places in 292 ms of which 7 ms to minimize.
[2022-05-15 20:06:16] [INFO ] Deduced a trap composed of 163 places in 224 ms of which 2 ms to minimize.
[2022-05-15 20:06:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 720 ms
[2022-05-15 20:06:16] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 84 ms.
[2022-05-15 20:06:20] [INFO ] Deduced a trap composed of 64 places in 564 ms of which 2 ms to minimize.
[2022-05-15 20:06:20] [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-05-15 20:06:21] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2022-05-15 20:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:21] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-05-15 20:06:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:06:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2022-05-15 20:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:22] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-15 20:06:22] [INFO ] Deduced a trap composed of 67 places in 410 ms of which 2 ms to minimize.
[2022-05-15 20:06:22] [INFO ] Deduced a trap composed of 131 places in 312 ms of which 2 ms to minimize.
[2022-05-15 20:06:23] [INFO ] Deduced a trap composed of 195 places in 217 ms of which 1 ms to minimize.
[2022-05-15 20:06:23] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:06:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1330 ms
[2022-05-15 20:06:23] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 78 ms.
[2022-05-15 20:06:27] [INFO ] Deduced a trap composed of 64 places in 531 ms of which 2 ms to minimize.
[2022-05-15 20:06:27] [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-05-15 20:06:27] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2022-05-15 20:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:27] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2022-05-15 20:06:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:06:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2022-05-15 20:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:28] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-05-15 20:06:28] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 1 ms to minimize.
[2022-05-15 20:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2022-05-15 20:06:28] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 71 ms.
[2022-05-15 20:06:33] [INFO ] Deduced a trap composed of 64 places in 427 ms of which 27 ms to minimize.
[2022-05-15 20:06:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-15 20:06:33] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2022-05-15 20:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:33] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2022-05-15 20:06:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:06:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2022-05-15 20:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:34] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-05-15 20:06:34] [INFO ] Deduced a trap composed of 67 places in 435 ms of which 2 ms to minimize.
[2022-05-15 20:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 518 ms
[2022-05-15 20:06:34] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 72 ms.
[2022-05-15 20:06:38] [INFO ] Added : 320 causal constraints over 64 iterations in 4018 ms. Result :unknown
[2022-05-15 20:06:38] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2022-05-15 20:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:39] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2022-05-15 20:06:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:06:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-05-15 20:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:06:39] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2022-05-15 20:06:40] [INFO ] Deduced a trap composed of 189 places in 276 ms of which 1 ms to minimize.
[2022-05-15 20:06:40] [INFO ] Deduced a trap composed of 188 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:06:40] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 1 ms to minimize.
[2022-05-15 20:06:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 706 ms
[2022-05-15 20:06:40] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 65 ms.
[2022-05-15 20:06: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 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.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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 77900 steps, including 992 resets, run finished after 279 ms. (steps per millisecond=279 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA FlexibleBarrier-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 542 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 517 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 10 ms
Free SCC test removed 32 places
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 510 transition count 437
Reduce places removed 145 places and 0 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 291 place count 365 transition count 437
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 291 place count 365 transition count 409
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 347 place count 337 transition count 409
Discarding 166 places :
Symmetric choice reduction at 2 with 166 rule applications. Total rules 513 place count 171 transition count 243
Iterating global reduction 2 with 166 rules applied. Total rules applied 679 place count 171 transition count 243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 679 place count 171 transition count 236
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 693 place count 164 transition count 236
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 698 place count 164 transition count 231
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 722 place count 140 transition count 207
Iterating global reduction 3 with 24 rules applied. Total rules applied 746 place count 140 transition count 207
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 769 place count 140 transition count 184
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 833 place count 108 transition count 152
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 839 place count 108 transition count 146
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 845 place count 102 transition count 140
Iterating global reduction 5 with 6 rules applied. Total rules applied 851 place count 102 transition count 140
Free-agglomeration rule applied 64 times.
Iterating global reduction 5 with 64 rules applied. Total rules applied 915 place count 102 transition count 76
Reduce places removed 64 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 99 edges and 38 vertex of which 28 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 90 rules applied. Total rules applied 1005 place count 28 transition count 51
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1019 place count 28 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1020 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 26 vertex of which 8 / 26 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1022 place count 22 transition count 36
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1030 place count 22 transition count 28
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 1030 place count 22 transition count 24
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1038 place count 18 transition count 24
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1042 place count 18 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1050 place count 14 transition count 16
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1054 place count 14 transition count 12
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1064 place count 8 transition count 8
Applied a total of 1064 rules in 242 ms. Remains 8 /542 variables (removed 534) and now considering 8/621 (removed 613) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/542 places, 8/621 transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 20:06:44] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 3) seen :3
FORMULA FlexibleBarrier-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652645206688

--------------------
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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r107-smll-165260580300010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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