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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 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 1.8M 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-22b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652645865165

Running Version 0
[2022-05-15 20:17:48] [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:17:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:17:49] [INFO ] Load time of PNML (sax parser for PT used): 502 ms
[2022-05-15 20:17:49] [INFO ] Transformed 6478 places.
[2022-05-15 20:17:49] [INFO ] Transformed 7469 transitions.
[2022-05-15 20:17:49] [INFO ] Found NUPN structural information;
[2022-05-15 20:17:49] [INFO ] Parsed PT model containing 6478 places and 7469 transitions in 702 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 7469 rows 6478 cols
[2022-05-15 20:17:50] [INFO ] Computed 24 place invariants in 381 ms
Incomplete random walk after 10000 steps, including 68 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :4
FORMULA FlexibleBarrier-PT-22b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-22b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :1
FORMULA FlexibleBarrier-PT-22b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :1
FORMULA FlexibleBarrier-PT-22b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 7469 rows 6478 cols
[2022-05-15 20:17:50] [INFO ] Computed 24 place invariants in 340 ms
[2022-05-15 20:17:53] [INFO ] [Real]Absence check using 24 positive place invariants in 414 ms returned sat
[2022-05-15 20:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:17:55] [INFO ] [Real]Absence check using state equation in 1951 ms returned unknown
[2022-05-15 20:17:57] [INFO ] [Real]Absence check using 24 positive place invariants in 319 ms returned sat
[2022-05-15 20:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18:00] [INFO ] [Real]Absence check using state equation in 2951 ms returned unknown
[2022-05-15 20:18:02] [INFO ] [Real]Absence check using 24 positive place invariants in 402 ms returned sat
[2022-05-15 20:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18: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: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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:18:07] [INFO ] [Real]Absence check using 24 positive place invariants in 379 ms returned sat
[2022-05-15 20:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18:10] [INFO ] [Real]Absence check using state equation in 3137 ms returned unknown
[2022-05-15 20:18:13] [INFO ] [Real]Absence check using 24 positive place invariants in 370 ms returned sat
[2022-05-15 20:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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:18:18] [INFO ] [Real]Absence check using 24 positive place invariants in 345 ms returned sat
[2022-05-15 20:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18:20] [INFO ] [Real]Absence check using state equation in 2785 ms returned unknown
[2022-05-15 20:18:22] [INFO ] [Real]Absence check using 24 positive place invariants in 299 ms returned sat
[2022-05-15 20:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18:25] [INFO ] [Real]Absence check using state equation in 3077 ms returned unknown
[2022-05-15 20:18:27] [INFO ] [Real]Absence check using 24 positive place invariants in 294 ms returned sat
[2022-05-15 20:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18:30] [INFO ] [Real]Absence check using state equation in 3108 ms returned unknown
[2022-05-15 20:18:32] [INFO ] [Real]Absence check using 24 positive place invariants in 316 ms returned sat
[2022-05-15 20:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:18:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 6478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 6397 edges and 6478 vertex of which 134 / 6478 are part of one of the 22 SCC in 42 ms
Free SCC test removed 112 places
Drop transitions removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Drop transitions removed 1563 transitions
Trivial Post-agglo rules discarded 1563 transitions
Performed 1563 trivial Post agglomeration. Transition count delta: 1563
Iterating post reduction 0 with 1563 rules applied. Total rules applied 1564 place count 6366 transition count 5771
Reduce places removed 1563 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1568 rules applied. Total rules applied 3132 place count 4803 transition count 5766
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3137 place count 4798 transition count 5766
Performed 456 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 456 Pre rules applied. Total rules applied 3137 place count 4798 transition count 5310
Deduced a syphon composed of 456 places in 9 ms
Reduce places removed 456 places and 0 transitions.
Iterating global reduction 3 with 912 rules applied. Total rules applied 4049 place count 4342 transition count 5310
Discarding 2691 places :
Symmetric choice reduction at 3 with 2691 rule applications. Total rules 6740 place count 1651 transition count 2619
Iterating global reduction 3 with 2691 rules applied. Total rules applied 9431 place count 1651 transition count 2619
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 9431 place count 1651 transition count 2597
Deduced a syphon composed of 22 places in 10 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 9475 place count 1629 transition count 2597
Discarding 441 places :
Symmetric choice reduction at 3 with 441 rule applications. Total rules 9916 place count 1188 transition count 2156
Iterating global reduction 3 with 441 rules applied. Total rules applied 10357 place count 1188 transition count 2156
Ensure Unique test removed 436 transitions
Reduce isomorphic transitions removed 436 transitions.
Iterating post reduction 3 with 436 rules applied. Total rules applied 10793 place count 1188 transition count 1720
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 4 with 222 rules applied. Total rules applied 11015 place count 1077 transition count 1609
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 11059 place count 1077 transition count 1565
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 11079 place count 1057 transition count 1545
Iterating global reduction 5 with 20 rules applied. Total rules applied 11099 place count 1057 transition count 1545
Free-agglomeration rule applied 931 times.
Iterating global reduction 5 with 931 rules applied. Total rules applied 12030 place count 1057 transition count 614
Reduce places removed 931 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 343 edges and 126 vertex of which 86 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1372 rules applied. Total rules applied 13402 place count 86 transition count 174
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 6 with 56 rules applied. Total rules applied 13458 place count 86 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 13459 place count 85 transition count 117
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t6466.t6218.t6219 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 66 edges and 83 vertex of which 24 / 83 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 13462 place count 71 transition count 115
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 13486 place count 71 transition count 91
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 13486 place count 71 transition count 76
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 13516 place count 56 transition count 76
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 13530 place count 56 transition count 62
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 13530 place count 56 transition count 60
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 13534 place count 54 transition count 60
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 13558 place count 42 transition count 48
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 13570 place count 42 transition count 36
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 29 rules applied. Total rules applied 13599 place count 24 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 13600 place count 24 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 13600 place count 24 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 13602 place count 23 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 13603 place count 23 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 13604 place count 22 transition count 22
Applied a total of 13604 rules in 3965 ms. Remains 22 /6478 variables (removed 6456) and now considering 22/7469 (removed 7447) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/6478 places, 22/7469 transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-15 20:18:39] [INFO ] Computed 9 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 9) seen :9
FORMULA FlexibleBarrier-PT-22b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652645922734

--------------------
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-22b"
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-22b, 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-165260580300058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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