Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.3K Feb 26 09:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 09:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 362K Mar 5 18:23 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-1B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678811630655

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-14 16:33:53] [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]
[2023-03-14 16:33:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 16:33:54] [INFO ] Load time of PNML (sax parser for PT used): 416 ms
[2023-03-14 16:33:54] [INFO ] Transformed 1416 places.
[2023-03-14 16:33:54] [INFO ] Transformed 1640 transitions.
[2023-03-14 16:33:54] [INFO ] Found NUPN structural information;
[2023-03-14 16:33:54] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 596 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-14 16:33:54] [INFO ] Computed 40 place invariants in 72 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-1B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :1
FORMULA NoC3x3-PT-1B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-1B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
[2023-03-14 16:33:54] [INFO ] Invariant cache hit.
[2023-03-14 16:33:55] [INFO ] [Real]Absence check using 40 positive place invariants in 79 ms returned sat
[2023-03-14 16:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:33:56] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2023-03-14 16:33:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 16:33:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 90 ms returned sat
[2023-03-14 16:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 16:33:58] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2023-03-14 16:33:58] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 8 ms to minimize.
[2023-03-14 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2023-03-14 16:33:59] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 262 ms.
[2023-03-14 16:34:03] [INFO ] Deduced a trap composed of 7 places in 1243 ms of which 3 ms to minimize.
[2023-03-14 16:34:03] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 16:34:03] [INFO ] [Real]Absence check using 40 positive place invariants in 48 ms returned sat
[2023-03-14 16:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:34:04] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2023-03-14 16:34:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 16:34:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 81 ms returned sat
[2023-03-14 16:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 16:34:06] [INFO ] [Nat]Absence check using state equation in 1061 ms returned sat
[2023-03-14 16:34:06] [INFO ] Deduced a trap composed of 85 places in 226 ms of which 2 ms to minimize.
[2023-03-14 16:34:06] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2023-03-14 16:34:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 630 ms
[2023-03-14 16:34:07] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 208 ms.
[2023-03-14 16:34:09] [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:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 16:34:10] [INFO ] [Real]Absence check using 40 positive place invariants in 75 ms returned sat
[2023-03-14 16:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:34:11] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2023-03-14 16:34:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 16:34:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 75 ms returned sat
[2023-03-14 16:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 16:34:12] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2023-03-14 16:34:13] [INFO ] Deduced a trap composed of 95 places in 222 ms of which 2 ms to minimize.
[2023-03-14 16:34:13] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 1 ms to minimize.
[2023-03-14 16:34:13] [INFO ] Deduced a trap composed of 140 places in 97 ms of which 1 ms to minimize.
[2023-03-14 16:34:13] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2023-03-14 16:34:13] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 0 ms to minimize.
[2023-03-14 16:34:13] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 0 ms to minimize.
[2023-03-14 16:34:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1249 ms
[2023-03-14 16:34:14] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 164 ms.
[2023-03-14 16:34:17] [INFO ] Deduced a trap composed of 7 places in 1092 ms of which 2 ms to minimize.
[2023-03-14 16:34:17] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 16:34:17] [INFO ] [Real]Absence check using 40 positive place invariants in 52 ms returned sat
[2023-03-14 16:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:34:18] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2023-03-14 16:34:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 16:34:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 78 ms returned sat
[2023-03-14 16:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 16:34:20] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2023-03-14 16:34:20] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 0 ms to minimize.
[2023-03-14 16:34:20] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 1 ms to minimize.
[2023-03-14 16:34:21] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 0 ms to minimize.
[2023-03-14 16:34:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 728 ms
[2023-03-14 16:34:21] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 184 ms.
[2023-03-14 16:34:24] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1439 edges and 1416 vertex of which 916 / 1416 are part of one of the 20 SCC in 15 ms
Free SCC test removed 896 places
Drop transitions removed 1084 transitions
Reduce isomorphic transitions removed 1084 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 520 transition count 536
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 500 transition count 536
Discarding 167 places :
Symmetric choice reduction at 2 with 167 rule applications. Total rules 208 place count 333 transition count 369
Iterating global reduction 2 with 167 rules applied. Total rules applied 375 place count 333 transition count 369
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 375 place count 333 transition count 333
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 447 place count 297 transition count 333
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 473 place count 271 transition count 295
Iterating global reduction 2 with 26 rules applied. Total rules applied 499 place count 271 transition count 295
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 617 place count 212 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 618 place count 211 transition count 234
Iterating global reduction 2 with 1 rules applied. Total rules applied 619 place count 211 transition count 234
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 2 with 2 rules applied. Total rules applied 621 place count 210 transition count 245
Free-agglomeration rule applied 107 times.
Iterating global reduction 2 with 107 rules applied. Total rules applied 728 place count 210 transition count 138
Reduce places removed 107 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 268 edges and 103 vertex of which 32 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.2 ms
Discarding 71 places :
Also discarding 51 output transitions
Drop transitions removed 51 transitions
Iterating post reduction 2 with 128 rules applied. Total rules applied 856 place count 32 transition count 67
Drop transitions removed 38 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 897 place count 32 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 898 place count 31 transition count 25
Reduce places removed 12 places and 0 transitions.
Graph (trivial) has 16 edges and 19 vertex of which 8 / 19 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 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 15 rules applied. Total rules applied 913 place count 13 transition count 23
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 926 place count 11 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 926 place count 11 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 930 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 931 place count 9 transition count 9
Applied a total of 931 rules in 324 ms. Remains 9 /1416 variables (removed 1407) and now considering 9/1640 (removed 1631) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 9/1416 places, 9/1640 transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-03-14 16:34:24] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties (out of 4) seen :4
FORMULA NoC3x3-PT-1B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31697 ms.

BK_STOP 1678811666097

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-1B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-1B, 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 r261-smll-167863536100237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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