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-171654372700371.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-3B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 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 581K 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-3B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716689945855

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-3B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-26 02:19:07] [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:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:19:07] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-26 02:19:07] [INFO ] Transformed 2117 places.
[2024-05-26 02:19:07] [INFO ] Transformed 2435 transitions.
[2024-05-26 02:19:07] [INFO ] Found NUPN structural information;
[2024-05-26 02:19:07] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2435 rows 2117 cols
[2024-05-26 02:19:07] [INFO ] Computed 66 invariants in 46 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-3B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-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 6) seen :1
FORMULA NoC3x3-PT-3B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :2
FORMULA NoC3x3-PT-3B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-26 02:19:08] [INFO ] Invariant cache hit.
[2024-05-26 02:19:08] [INFO ] [Real]Absence check using 66 positive place invariants in 70 ms returned sat
[2024-05-26 02:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:19:09] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2024-05-26 02:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:19:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2024-05-26 02:19:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:19:10] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2024-05-26 02:19:11] [INFO ] Deduced a trap composed of 44 places in 400 ms of which 3 ms to minimize.
[2024-05-26 02:19:11] [INFO ] Deduced a trap composed of 77 places in 324 ms of which 1 ms to minimize.
[2024-05-26 02:19:12] [INFO ] Deduced a trap composed of 90 places in 339 ms of which 2 ms to minimize.
[2024-05-26 02:19:12] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 2 ms to minimize.
[2024-05-26 02:19:12] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 1 ms to minimize.
[2024-05-26 02:19:13] [INFO ] Deduced a trap composed of 81 places in 360 ms of which 1 ms to minimize.
[2024-05-26 02:19:13] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 1 ms to minimize.
[2024-05-26 02:19:13] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 1 ms to minimize.
[2024-05-26 02:19:13] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 1 ms to minimize.
[2024-05-26 02:19:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2962 ms
[2024-05-26 02:19:13] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 129 ms.
[2024-05-26 02:19:15] [INFO ] Deduced a trap composed of 7 places in 934 ms of which 2 ms to minimize.
[2024-05-26 02:19: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 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:19:15] [INFO ] [Real]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-05-26 02:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:19:16] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2024-05-26 02:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:19:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 56 ms returned sat
[2024-05-26 02:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:19:17] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2024-05-26 02:19:18] [INFO ] Deduced a trap composed of 54 places in 406 ms of which 1 ms to minimize.
[2024-05-26 02:19:18] [INFO ] Deduced a trap composed of 105 places in 384 ms of which 1 ms to minimize.
[2024-05-26 02:19:19] [INFO ] Deduced a trap composed of 82 places in 335 ms of which 1 ms to minimize.
[2024-05-26 02:19:19] [INFO ] Deduced a trap composed of 102 places in 328 ms of which 1 ms to minimize.
[2024-05-26 02:19:20] [INFO ] Deduced a trap composed of 97 places in 274 ms of which 1 ms to minimize.
[2024-05-26 02:19:20] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 0 ms to minimize.
[2024-05-26 02:19:20] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 1 ms to minimize.
[2024-05-26 02:19:20] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 1 ms to minimize.
[2024-05-26 02:19:21] [INFO ] Deduced a trap composed of 106 places in 241 ms of which 1 ms to minimize.
[2024-05-26 02:19:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3385 ms
[2024-05-26 02:19:21] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 115 ms.
[2024-05-26 02:19:21] [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.refineWithCausalOrder(DeadlockTester.java:1189)
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:19:22] [INFO ] [Real]Absence check using 66 positive place invariants in 56 ms returned sat
[2024-05-26 02:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:19:23] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2024-05-26 02:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:19:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 52 ms returned sat
[2024-05-26 02:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:19:24] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2024-05-26 02:19:24] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 1 ms to minimize.
[2024-05-26 02:19:24] [INFO ] Deduced a trap composed of 96 places in 274 ms of which 1 ms to minimize.
[2024-05-26 02:19:25] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 3 ms to minimize.
[2024-05-26 02:19:25] [INFO ] Deduced a trap composed of 76 places in 229 ms of which 1 ms to minimize.
[2024-05-26 02:19:25] [INFO ] Deduced a trap composed of 77 places in 294 ms of which 1 ms to minimize.
[2024-05-26 02:19:26] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 1 ms to minimize.
[2024-05-26 02:19:26] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 1 ms to minimize.
[2024-05-26 02:19:26] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 1 ms to minimize.
[2024-05-26 02:19:26] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 1 ms to minimize.
[2024-05-26 02:19:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2574 ms
[2024-05-26 02:19:27] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 133 ms.
[2024-05-26 02:19:28] [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.refineWithCausalOrder(DeadlockTester.java:1189)
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 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1741 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 8 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 443 rules applied. Total rules applied 444 place count 2049 transition count 1925
Reduce places removed 438 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 444 rules applied. Total rules applied 888 place count 1611 transition count 1919
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 892 place count 1608 transition count 1918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 893 place count 1607 transition count 1918
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 893 place count 1607 transition count 1894
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 941 place count 1583 transition count 1894
Discarding 364 places :
Symmetric choice reduction at 4 with 364 rule applications. Total rules 1305 place count 1219 transition count 1530
Iterating global reduction 4 with 364 rules applied. Total rules applied 1669 place count 1219 transition count 1530
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1669 place count 1219 transition count 1489
Deduced a syphon composed of 41 places in 8 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1751 place count 1178 transition count 1489
Discarding 135 places :
Symmetric choice reduction at 4 with 135 rule applications. Total rules 1886 place count 1043 transition count 1314
Iterating global reduction 4 with 135 rules applied. Total rules applied 2021 place count 1043 transition count 1314
Discarding 139 places :
Symmetric choice reduction at 4 with 139 rule applications. Total rules 2160 place count 904 transition count 1159
Iterating global reduction 4 with 139 rules applied. Total rules applied 2299 place count 904 transition count 1159
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 2356 place count 847 transition count 1059
Iterating global reduction 4 with 57 rules applied. Total rules applied 2413 place count 847 transition count 1059
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 4 with 20 rules applied. Total rules applied 2433 place count 845 transition count 1041
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2435 place count 843 transition count 1041
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2476 place count 802 transition count 1000
Iterating global reduction 6 with 41 rules applied. Total rules applied 2517 place count 802 transition count 1000
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2525 place count 798 transition count 996
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2529 place count 794 transition count 996
Discarding 31 places :
Symmetric choice reduction at 8 with 31 rule applications. Total rules 2560 place count 763 transition count 934
Iterating global reduction 8 with 31 rules applied. Total rules applied 2591 place count 763 transition count 934
Discarding 31 places :
Symmetric choice reduction at 8 with 31 rule applications. Total rules 2622 place count 732 transition count 903
Iterating global reduction 8 with 31 rules applied. Total rules applied 2653 place count 732 transition count 903
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 41 rules applied. Total rules applied 2694 place count 727 transition count 867
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2699 place count 722 transition count 867
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Deduced a syphon composed of 306 places in 1 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 10 with 612 rules applied. Total rules applied 3311 place count 416 transition count 561
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 3326 place count 401 transition count 546
Iterating global reduction 10 with 15 rules applied. Total rules applied 3341 place count 401 transition count 546
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 3352 place count 390 transition count 524
Iterating global reduction 10 with 11 rules applied. Total rules applied 3363 place count 390 transition count 524
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3365 place count 390 transition count 522
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3367 place count 388 transition count 518
Iterating global reduction 11 with 2 rules applied. Total rules applied 3369 place count 388 transition count 518
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 30 rules applied. Total rules applied 3399 place count 373 transition count 541
Free-agglomeration rule applied 24 times.
Iterating global reduction 11 with 24 rules applied. Total rules applied 3423 place count 373 transition count 517
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 31 rules applied. Total rules applied 3454 place count 349 transition count 510
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 3458 place count 349 transition count 506
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3462 place count 345 transition count 506
Applied a total of 3462 rules in 736 ms. Remains 345 /2117 variables (removed 1772) and now considering 506/2435 (removed 1929) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 738 ms. Remains : 345/2117 places, 506/2435 transitions.
// Phase 1: matrix 506 rows 345 cols
[2024-05-26 02:19:28] [INFO ] Computed 54 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13787 resets, run finished after 3938 ms. (steps per millisecond=253 ) properties (out of 3) seen :3
FORMULA NoC3x3-PT-3B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 25543 ms.

BK_STOP 1716689973713

--------------------
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-3B"
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-3B, 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-171654372700371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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