Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372600361.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-2B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372600361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 548K May 18 16:43 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 NoC3x3-PT-2B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716689698599

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-26 02:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:15:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:15:00] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-26 02:15:00] [INFO ] Transformed 2003 places.
[2024-05-26 02:15:01] [INFO ] Transformed 2292 transitions.
[2024-05-26 02:15:01] [INFO ] Found NUPN structural information;
[2024-05-26 02:15:01] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2292 rows 2003 cols
[2024-05-26 02:15:01] [INFO ] Computed 66 invariants in 39 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :12
FORMULA NoC3x3-PT-2B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) 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 4) seen :1
FORMULA NoC3x3-PT-2B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
[2024-05-26 02:15:01] [INFO ] Invariant cache hit.
[2024-05-26 02:15:01] [INFO ] [Real]Absence check using 66 positive place invariants in 58 ms returned sat
[2024-05-26 02:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:15:02] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2024-05-26 02:15:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:15:03] [INFO ] [Nat]Absence check using 66 positive place invariants in 55 ms returned sat
[2024-05-26 02:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:15:03] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2024-05-26 02:15:04] [INFO ] Deduced a trap composed of 55 places in 433 ms of which 5 ms to minimize.
[2024-05-26 02:15:04] [INFO ] Deduced a trap composed of 132 places in 408 ms of which 2 ms to minimize.
[2024-05-26 02:15:05] [INFO ] Deduced a trap composed of 87 places in 478 ms of which 2 ms to minimize.
[2024-05-26 02:15:05] [INFO ] Deduced a trap composed of 195 places in 443 ms of which 2 ms to minimize.
[2024-05-26 02:15:06] [INFO ] Deduced a trap composed of 143 places in 373 ms of which 2 ms to minimize.
[2024-05-26 02:15:06] [INFO ] Deduced a trap composed of 198 places in 340 ms of which 1 ms to minimize.
[2024-05-26 02:15:07] [INFO ] Deduced a trap composed of 122 places in 320 ms of which 1 ms to minimize.
[2024-05-26 02:15:07] [INFO ] Deduced a trap composed of 151 places in 270 ms of which 1 ms to minimize.
[2024-05-26 02:15:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3725 ms
[2024-05-26 02:15:07] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 118 ms.
[2024-05-26 02:15:08] [INFO ] Deduced a trap composed of 7 places in 841 ms of which 2 ms to minimize.
[2024-05-26 02:15:08] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 02:15:08] [INFO ] [Real]Absence check using 66 positive place invariants in 49 ms returned sat
[2024-05-26 02:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:15:09] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2024-05-26 02:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:15:10] [INFO ] [Nat]Absence check using 66 positive place invariants in 49 ms returned sat
[2024-05-26 02:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:15:10] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2024-05-26 02:15:11] [INFO ] Deduced a trap composed of 63 places in 244 ms of which 1 ms to minimize.
[2024-05-26 02:15:11] [INFO ] Deduced a trap composed of 130 places in 210 ms of which 1 ms to minimize.
[2024-05-26 02:15:11] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 1 ms to minimize.
[2024-05-26 02:15:11] [INFO ] Deduced a trap composed of 103 places in 206 ms of which 0 ms to minimize.
[2024-05-26 02:15:12] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 1 ms to minimize.
[2024-05-26 02:15:12] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 1 ms to minimize.
[2024-05-26 02:15:12] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 1 ms to minimize.
[2024-05-26 02:15:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1879 ms
[2024-05-26 02:15:12] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 111 ms.
[2024-05-26 02:15:15] [INFO ] Deduced a trap composed of 7 places in 895 ms of which 2 ms to minimize.
[2024-05-26 02:15: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: 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 02:15:15] [INFO ] [Real]Absence check using 66 positive place invariants in 47 ms returned sat
[2024-05-26 02:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:15:16] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-05-26 02:15:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:15:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 49 ms returned sat
[2024-05-26 02:15:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:15:17] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2024-05-26 02:15:18] [INFO ] Deduced a trap composed of 93 places in 331 ms of which 0 ms to minimize.
[2024-05-26 02:15:18] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2024-05-26 02:15:18] [INFO ] Deduced a trap composed of 115 places in 321 ms of which 1 ms to minimize.
[2024-05-26 02:15:19] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 0 ms to minimize.
[2024-05-26 02:15:19] [INFO ] Deduced a trap composed of 127 places in 225 ms of which 1 ms to minimize.
[2024-05-26 02:15:19] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 1 ms to minimize.
[2024-05-26 02:15:20] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 1 ms to minimize.
[2024-05-26 02:15:20] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 1 ms to minimize.
[2024-05-26 02:15:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2815 ms
[2024-05-26 02:15:20] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 108 ms.
[2024-05-26 02:15:22] [INFO ] Deduced a trap composed of 7 places in 866 ms of which 2 ms to minimize.
[2024-05-26 02:15:22] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1629 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 7 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 405 transitions
Trivial Post-agglo rules discarded 405 transitions
Performed 405 trivial Post agglomeration. Transition count delta: 405
Iterating post reduction 0 with 414 rules applied. Total rules applied 415 place count 1931 transition count 1815
Reduce places removed 405 places and 0 transitions.
Iterating post reduction 1 with 405 rules applied. Total rules applied 820 place count 1526 transition count 1815
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 820 place count 1526 transition count 1791
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 868 place count 1502 transition count 1791
Discarding 349 places :
Symmetric choice reduction at 2 with 349 rule applications. Total rules 1217 place count 1153 transition count 1442
Iterating global reduction 2 with 349 rules applied. Total rules applied 1566 place count 1153 transition count 1442
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 1566 place count 1153 transition count 1402
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 1646 place count 1113 transition count 1402
Discarding 130 places :
Symmetric choice reduction at 2 with 130 rule applications. Total rules 1776 place count 983 transition count 1235
Iterating global reduction 2 with 130 rules applied. Total rules applied 1906 place count 983 transition count 1235
Discarding 124 places :
Symmetric choice reduction at 2 with 124 rule applications. Total rules 2030 place count 859 transition count 1097
Iterating global reduction 2 with 124 rules applied. Total rules applied 2154 place count 859 transition count 1097
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 2203 place count 810 transition count 1011
Iterating global reduction 2 with 49 rules applied. Total rules applied 2252 place count 810 transition count 1011
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 2270 place count 808 transition count 995
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2272 place count 806 transition count 995
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 2307 place count 771 transition count 960
Iterating global reduction 4 with 35 rules applied. Total rules applied 2342 place count 771 transition count 960
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 2346 place count 769 transition count 958
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2348 place count 767 transition count 958
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2372 place count 743 transition count 910
Iterating global reduction 6 with 24 rules applied. Total rules applied 2396 place count 743 transition count 910
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2420 place count 719 transition count 886
Iterating global reduction 6 with 24 rules applied. Total rules applied 2444 place count 719 transition count 886
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 30 rules applied. Total rules applied 2474 place count 716 transition count 859
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2477 place count 713 transition count 859
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 8 with 596 rules applied. Total rules applied 3073 place count 415 transition count 561
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 3085 place count 403 transition count 549
Iterating global reduction 8 with 12 rules applied. Total rules applied 3097 place count 403 transition count 549
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3106 place count 394 transition count 531
Iterating global reduction 8 with 9 rules applied. Total rules applied 3115 place count 394 transition count 531
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3117 place count 392 transition count 526
Iterating global reduction 8 with 2 rules applied. Total rules applied 3119 place count 392 transition count 526
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 3153 place count 375 transition count 555
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 3176 place count 375 transition count 532
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 3206 place count 352 transition count 525
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3207 place count 352 transition count 524
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3208 place count 351 transition count 524
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3209 place count 351 transition count 524
Applied a total of 3209 rules in 692 ms. Remains 351 /2003 variables (removed 1652) and now considering 524/2292 (removed 1768) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 351/2003 places, 524/2292 transitions.
// Phase 1: matrix 524 rows 351 cols
[2024-05-26 02:15:23] [INFO ] Computed 53 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13923 resets, run finished after 3868 ms. (steps per millisecond=258 ) properties (out of 3) seen :3
FORMULA NoC3x3-PT-2B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 26426 ms.

BK_STOP 1716689728280

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="NoC3x3-PT-2B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-2B, 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 r263-tall-171654372600361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2B.tgz
mv NoC3x3-PT-2B 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 ;