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.r161-smll-165277002700082.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 NoC3x3-PT-7B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002700082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.2K Apr 29 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.0M May 10 09:34 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-7B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652989877375

Running Version 0
[2022-05-19 19:51:20] [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-19 19:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:51:21] [INFO ] Load time of PNML (sax parser for PT used): 766 ms
[2022-05-19 19:51:21] [INFO ] Transformed 7014 places.
[2022-05-19 19:51:21] [INFO ] Transformed 8833 transitions.
[2022-05-19 19:51:21] [INFO ] Found NUPN structural information;
[2022-05-19 19:51:21] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 935 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 8833 rows 7014 cols
[2022-05-19 19:51:22] [INFO ] Computed 66 place invariants in 172 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 16) seen :6
FORMULA NoC3x3-PT-7B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :1
FORMULA NoC3x3-PT-7B-UpperBounds-12 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
// Phase 1: matrix 8833 rows 7014 cols
[2022-05-19 19:51:22] [INFO ] Computed 66 place invariants in 70 ms
[2022-05-19 19:51:25] [INFO ] [Real]Absence check using 66 positive place invariants in 367 ms returned sat
[2022-05-19 19:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:51:27] [INFO ] [Real]Absence check using state equation in 2228 ms returned unknown
[2022-05-19 19:51:29] [INFO ] [Real]Absence check using 66 positive place invariants in 345 ms returned sat
[2022-05-19 19:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:51:32] [INFO ] [Real]Absence check using state equation in 3029 ms returned unknown
[2022-05-19 19:51:35] [INFO ] [Real]Absence check using 66 positive place invariants in 347 ms returned sat
[2022-05-19 19:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:51:37] [INFO ] [Real]Absence check using state equation in 2959 ms returned unknown
[2022-05-19 19:51:39] [INFO ] [Real]Absence check using 66 positive place invariants in 355 ms returned sat
[2022-05-19 19:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:51:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-19 19:51:45] [INFO ] [Real]Absence check using 66 positive place invariants in 357 ms returned sat
[2022-05-19 19:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:51:47] [INFO ] [Real]Absence check using state equation in 2945 ms returned unknown
[2022-05-19 19:51:49] [INFO ] [Real]Absence check using 66 positive place invariants in 372 ms returned sat
[2022-05-19 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:51:53] [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 5
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-19 19:51:55] [INFO ] [Real]Absence check using 66 positive place invariants in 364 ms returned sat
[2022-05-19 19:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:51:58] [INFO ] [Real]Absence check using state equation in 2937 ms returned unknown
[2022-05-19 19:52:00] [INFO ] [Real]Absence check using 66 positive place invariants in 357 ms returned sat
[2022-05-19 19:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:03] [INFO ] [Real]Absence check using state equation in 2996 ms returned unknown
[2022-05-19 19:52:05] [INFO ] [Real]Absence check using 66 positive place invariants in 366 ms returned sat
[2022-05-19 19:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:08] [INFO ] [Real]Absence check using state equation in 2985 ms returned unknown
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 7014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7804 edges and 7014 vertex of which 4854 / 7014 are part of one of the 33 SCC in 43 ms
Free SCC test removed 4821 places
Drop transitions removed 5912 transitions
Reduce isomorphic transitions removed 5912 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 362 place count 2193 transition count 2560
Reduce places removed 361 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 371 rules applied. Total rules applied 733 place count 1832 transition count 2550
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 746 place count 1823 transition count 2546
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 747 place count 1822 transition count 2546
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 747 place count 1822 transition count 2545
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 749 place count 1821 transition count 2545
Discarding 766 places :
Symmetric choice reduction at 4 with 766 rule applications. Total rules 1515 place count 1055 transition count 1779
Iterating global reduction 4 with 766 rules applied. Total rules applied 2281 place count 1055 transition count 1779
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 2285 place count 1055 transition count 1775
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2287 place count 1053 transition count 1775
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 63 Pre rules applied. Total rules applied 2287 place count 1053 transition count 1712
Deduced a syphon composed of 63 places in 15 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 2413 place count 990 transition count 1712
Discarding 490 places :
Symmetric choice reduction at 6 with 490 rule applications. Total rules 2903 place count 500 transition count 997
Iterating global reduction 6 with 490 rules applied. Total rules applied 3393 place count 500 transition count 997
Ensure Unique test removed 434 transitions
Reduce isomorphic transitions removed 434 transitions.
Iterating post reduction 6 with 434 rules applied. Total rules applied 3827 place count 500 transition count 563
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 7 with 210 rules applied. Total rules applied 4037 place count 395 transition count 458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4039 place count 394 transition count 472
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 4041 place count 394 transition count 470
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 4048 place count 394 transition count 463
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4050 place count 393 transition count 474
Free-agglomeration rule applied 205 times.
Iterating global reduction 8 with 205 rules applied. Total rules applied 4255 place count 393 transition count 269
Reduce places removed 205 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 512 edges and 188 vertex of which 85 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.3 ms
Discarding 103 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Iterating post reduction 8 with 242 rules applied. Total rules applied 4497 place count 85 transition count 188
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 9 with 81 rules applied. Total rules applied 4578 place count 85 transition count 107
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 4581 place count 85 transition count 104
Graph (complete) has 227 edges and 85 vertex of which 77 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 4582 place count 77 transition count 100
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 4587 place count 77 transition count 95
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4588 place count 77 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 4589 place count 76 transition count 94
Applied a total of 4589 rules in 1026 ms. Remains 76 /7014 variables (removed 6938) and now considering 94/8833 (removed 8739) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/7014 places, 94/8833 transitions.
// Phase 1: matrix 94 rows 76 cols
[2022-05-19 19:52:09] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2132 ms. (steps per millisecond=469 ) properties (out of 9) seen :8
FORMULA NoC3x3-PT-7B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 1) seen :0
// Phase 1: matrix 94 rows 76 cols
[2022-05-19 19:52:11] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-19 19:52:11] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-19 19:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:11] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-19 19:52:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:52:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-19 19:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-19 19:52:12] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-19 19:52:12] [INFO ] [Nat]Added 54 Read/Feed constraints in 10 ms returned sat
[2022-05-19 19:52:12] [INFO ] Computed and/alt/rep : 71/444/71 causal constraints (skipped 19 transitions) in 11 ms.
[2022-05-19 19:52:12] [INFO ] Added : 48 causal constraints over 10 iterations in 261 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2100 steps, including 122 resets, run finished after 14 ms. (steps per millisecond=150 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 94/94 transitions.
Graph (trivial) has 12 edges and 76 vertex of which 8 / 76 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 197 edges and 72 vertex of which 21 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 53 output transitions
Drop transitions removed 53 transitions
Applied a total of 2 rules in 10 ms. Remains 21 /76 variables (removed 55) and now considering 33/94 (removed 61) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/76 places, 33/94 transitions.
// Phase 1: matrix 33 rows 21 cols
[2022-05-19 19:52:12] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 1) seen :0
// Phase 1: matrix 33 rows 21 cols
[2022-05-19 19:52:14] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-19 19:52:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-19 19:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:14] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-19 19:52:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:52:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-19 19:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:52:14] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-19 19:52:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-19 19:52:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2022-05-19 19:52:14] [INFO ] Computed and/alt/rep : 22/163/22 causal constraints (skipped 7 transitions) in 6 ms.
[2022-05-19 19:52:14] [INFO ] Added : 21 causal constraints over 5 iterations in 64 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1700 steps, including 515 resets, run finished after 8 ms. (steps per millisecond=212 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 33/33 transitions.
Applied a total of 0 rules in 7 ms. Remains 21 /21 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 33/33 transitions.
Starting structural reductions, iteration 0 : 21/21 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 21 cols
[2022-05-19 19:52:14] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-19 19:52:14] [INFO ] Implicit Places using invariants in 46 ms returned [1, 14, 15, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
[2022-05-19 19:52:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 33 rows 17 cols
[2022-05-19 19:52:14] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-19 19:52:14] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 17/21 places, 33/33 transitions.
Graph (trivial) has 11 edges and 17 vertex of which 8 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 3 ms. Remains 11 /17 variables (removed 6) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 11 cols
[2022-05-19 19:52:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 19:52:14] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 23 rows 11 cols
[2022-05-19 19:52:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 19:52:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 19:52:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/21 places, 23/33 transitions.
// Phase 1: matrix 23 rows 11 cols
[2022-05-19 19:52:14] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 297055 resets, run finished after 1234 ms. (steps per millisecond=810 ) properties (out of 1) seen :1
FORMULA NoC3x3-PT-7B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652989937052

--------------------
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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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 r161-smll-165277002700082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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