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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 14K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 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 608K 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-4B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678832497752

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 22:21:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 22:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 22:21:41] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2023-03-14 22:21:41] [INFO ] Transformed 2328 places.
[2023-03-14 22:21:41] [INFO ] Transformed 2701 transitions.
[2023-03-14 22:21:41] [INFO ] Found NUPN structural information;
[2023-03-14 22:21:41] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 592 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 2701 rows 2328 cols
[2023-03-14 22:21:41] [INFO ] Computed 66 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-4B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) 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 6) seen :1
FORMULA NoC3x3-PT-4B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
[2023-03-14 22:21:41] [INFO ] Invariant cache hit.
[2023-03-14 22:21:42] [INFO ] [Real]Absence check using 66 positive place invariants in 108 ms returned sat
[2023-03-14 22:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 22:21:44] [INFO ] [Real]Absence check using state equation in 1739 ms returned sat
[2023-03-14 22:21:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 22:21:45] [INFO ] [Nat]Absence check using 66 positive place invariants in 105 ms returned sat
[2023-03-14 22:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 22:21:47] [INFO ] [Nat]Absence check using state equation in 1675 ms returned sat
[2023-03-14 22:21:47] [INFO ] Deduced a trap composed of 120 places in 361 ms of which 8 ms to minimize.
[2023-03-14 22:21:48] [INFO ] Deduced a trap composed of 76 places in 318 ms of which 3 ms to minimize.
[2023-03-14 22:21:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1230 ms
[2023-03-14 22:21:48] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 269 ms.
[2023-03-14 22:21:51] [INFO ] Deduced a trap composed of 7 places in 1707 ms of which 4 ms to minimize.
[2023-03-14 22:21:51] [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 22:21:51] [INFO ] [Real]Absence check using 66 positive place invariants in 93 ms returned sat
[2023-03-14 22:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 22:21:53] [INFO ] [Real]Absence check using state equation in 1624 ms returned sat
[2023-03-14 22:21:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 22:21:54] [INFO ] [Nat]Absence check using 66 positive place invariants in 98 ms returned sat
[2023-03-14 22:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 22:21:56] [INFO ] [Nat]Absence check using state equation in 1728 ms returned sat
[2023-03-14 22:21:57] [INFO ] Deduced a trap composed of 77 places in 667 ms of which 4 ms to minimize.
[2023-03-14 22:21:57] [INFO ] Deduced a trap composed of 69 places in 541 ms of which 2 ms to minimize.
[2023-03-14 22:21:58] [INFO ] Deduced a trap composed of 101 places in 370 ms of which 1 ms to minimize.
[2023-03-14 22:21:58] [INFO ] Deduced a trap composed of 112 places in 338 ms of which 1 ms to minimize.
[2023-03-14 22:22:01] [INFO ] Deduced a trap composed of 7 places in 2362 ms of which 2 ms to minimize.
[2023-03-14 22:22:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 22:22:01] [INFO ] [Real]Absence check using 66 positive place invariants in 91 ms returned sat
[2023-03-14 22:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 22:22:03] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2023-03-14 22:22:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 22:22:03] [INFO ] [Nat]Absence check using 66 positive place invariants in 95 ms returned sat
[2023-03-14 22:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 22:22:05] [INFO ] [Nat]Absence check using state equation in 1478 ms returned sat
[2023-03-14 22:22:05] [INFO ] Deduced a trap composed of 109 places in 266 ms of which 1 ms to minimize.
[2023-03-14 22:22:06] [INFO ] Deduced a trap composed of 77 places in 192 ms of which 1 ms to minimize.
[2023-03-14 22:22:06] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 1 ms to minimize.
[2023-03-14 22:22:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1212 ms
[2023-03-14 22:22:06] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 239 ms.
[2023-03-14 22:22:10] [INFO ] Deduced a trap composed of 7 places in 1882 ms of which 3 ms to minimize.
[2023-03-14 22:22:10] [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 22:22:11] [INFO ] [Real]Absence check using 66 positive place invariants in 98 ms returned sat
[2023-03-14 22:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 22:22:12] [INFO ] [Real]Absence check using state equation in 1748 ms returned sat
[2023-03-14 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 22:22:13] [INFO ] [Nat]Absence check using 66 positive place invariants in 143 ms returned sat
[2023-03-14 22:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 22:22:15] [INFO ] [Nat]Absence check using state equation in 1758 ms returned sat
[2023-03-14 22:22:16] [INFO ] Deduced a trap composed of 101 places in 448 ms of which 1 ms to minimize.
[2023-03-14 22:22:16] [INFO ] Deduced a trap composed of 85 places in 387 ms of which 1 ms to minimize.
[2023-03-14 22:22:17] [INFO ] Deduced a trap composed of 80 places in 284 ms of which 1 ms to minimize.
[2023-03-14 22:22:17] [INFO ] Deduced a trap composed of 80 places in 289 ms of which 1 ms to minimize.
[2023-03-14 22:22:18] [INFO ] Deduced a trap composed of 80 places in 356 ms of which 2 ms to minimize.
[2023-03-14 22:22:18] [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 3
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.verifyPossible(DeadlockTester.java:916)
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 22:22:18] [INFO ] [Real]Absence check using 66 positive place invariants in 93 ms returned sat
[2023-03-14 22:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 22:22:20] [INFO ] [Real]Absence check using state equation in 1630 ms returned sat
[2023-03-14 22:22:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 22:22:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 93 ms returned sat
[2023-03-14 22:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 22:22:22] [INFO ] [Nat]Absence check using state equation in 1589 ms returned sat
[2023-03-14 22:22:23] [INFO ] Deduced a trap composed of 99 places in 343 ms of which 1 ms to minimize.
[2023-03-14 22:22:23] [INFO ] Deduced a trap composed of 69 places in 317 ms of which 1 ms to minimize.
[2023-03-14 22:22:24] [INFO ] Deduced a trap composed of 120 places in 270 ms of which 1 ms to minimize.
[2023-03-14 22:22:24] [INFO ] Deduced a trap composed of 107 places in 280 ms of which 1 ms to minimize.
[2023-03-14 22:22:25] [INFO ] Deduced a trap composed of 88 places in 206 ms of which 1 ms to minimize.
[2023-03-14 22:22:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2169 ms
[2023-03-14 22:22:25] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 261 ms.
[2023-03-14 22:22:25] [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 4
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 2328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2318 edges and 2328 vertex of which 1397 / 2328 are part of one of the 33 SCC in 21 ms
Free SCC test removed 1364 places
Drop transitions removed 1650 transitions
Reduce isomorphic transitions removed 1650 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 964 transition count 1018
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 931 transition count 1017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 930 transition count 1017
Discarding 325 places :
Symmetric choice reduction at 3 with 325 rule applications. Total rules 394 place count 605 transition count 692
Iterating global reduction 3 with 325 rules applied. Total rules applied 719 place count 605 transition count 692
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 719 place count 605 transition count 626
Deduced a syphon composed of 66 places in 3 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 851 place count 539 transition count 626
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 905 place count 485 transition count 541
Iterating global reduction 3 with 54 rules applied. Total rules applied 959 place count 485 transition count 541
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1159 place count 385 transition count 441
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1160 place count 384 transition count 438
Iterating global reduction 3 with 1 rules applied. Total rules applied 1161 place count 384 transition count 438
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 3 with 2 rules applied. Total rules applied 1163 place count 383 transition count 452
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1165 place count 383 transition count 450
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1171 place count 383 transition count 444
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 4 with 2 rules applied. Total rules applied 1173 place count 382 transition count 455
Free-agglomeration rule applied 200 times.
Iterating global reduction 4 with 200 rules applied. Total rules applied 1373 place count 382 transition count 255
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 493 edges and 182 vertex of which 50 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.1 ms
Discarding 132 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 4 with 237 rules applied. Total rules applied 1610 place count 50 transition count 103
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 1645 place count 50 transition count 68
Applied a total of 1645 rules in 642 ms. Remains 50 /2328 variables (removed 2278) and now considering 68/2701 (removed 2633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 50/2328 places, 68/2701 transitions.
// Phase 1: matrix 68 rows 50 cols
[2023-03-14 22:22:26] [INFO ] Computed 19 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 5) seen :4
FORMULA NoC3x3-PT-4B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 1) seen :1
FORMULA NoC3x3-PT-4B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 47730 ms.
ITS solved all properties within timeout

BK_STOP 1678832549227

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-4B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is NoC3x3-PT-4B, 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 r267-smll-167863541600285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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