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.r265-smll-167863539800237.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 ltsminxred
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 r265-smll-167863539800237
=====================================================================

--------------------
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 1678855789426

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 04:49:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 04:49:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 04:49:52] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2023-03-15 04:49:52] [INFO ] Transformed 1416 places.
[2023-03-15 04:49:52] [INFO ] Transformed 1640 transitions.
[2023-03-15 04:49:52] [INFO ] Found NUPN structural information;
[2023-03-15 04:49:52] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-15 04:49:52] [INFO ] Computed 40 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :8
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-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-10 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) 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 13 ms. (steps per millisecond=769 ) properties (out of 7) 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 7) seen :1
FORMULA NoC3x3-PT-1B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
[2023-03-15 04:49:53] [INFO ] Invariant cache hit.
[2023-03-15 04:49:53] [INFO ] [Real]Absence check using 40 positive place invariants in 61 ms returned sat
[2023-03-15 04:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:49:54] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2023-03-15 04:49:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:49:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 58 ms returned sat
[2023-03-15 04:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:49:56] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2023-03-15 04:49:56] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 5 ms to minimize.
[2023-03-15 04:49:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-15 04:49:56] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 215 ms.
[2023-03-15 04:50:00] [INFO ] Added : 145 causal constraints over 29 iterations in 3384 ms. Result :unknown
[2023-03-15 04:50:00] [INFO ] [Real]Absence check using 40 positive place invariants in 59 ms returned sat
[2023-03-15 04:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:01] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2023-03-15 04:50:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:50:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 54 ms returned sat
[2023-03-15 04:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:02] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2023-03-15 04:50:02] [INFO ] Deduced a trap composed of 80 places in 237 ms of which 2 ms to minimize.
[2023-03-15 04:50:03] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 2 ms to minimize.
[2023-03-15 04:50:03] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 1 ms to minimize.
[2023-03-15 04:50:03] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 1 ms to minimize.
[2023-03-15 04:50:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 991 ms
[2023-03-15 04:50:03] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 130 ms.
[2023-03-15 04:50:07] [INFO ] Deduced a trap composed of 7 places in 1299 ms of which 2 ms to minimize.
[2023-03-15 04:50:07] [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.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-15 04:50:08] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2023-03-15 04:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:09] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2023-03-15 04:50:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:50:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 58 ms returned sat
[2023-03-15 04:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:10] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2023-03-15 04:50:10] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 1 ms to minimize.
[2023-03-15 04:50:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-15 04:50:10] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 114 ms.
[2023-03-15 04:50:14] [INFO ] Deduced a trap composed of 7 places in 866 ms of which 2 ms to minimize.
[2023-03-15 04:50:14] [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-15 04:50:15] [INFO ] [Real]Absence check using 40 positive place invariants in 52 ms returned sat
[2023-03-15 04:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:16] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2023-03-15 04:50:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:50:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 53 ms returned sat
[2023-03-15 04:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:17] [INFO ] [Nat]Absence check using state equation in 841 ms returned sat
[2023-03-15 04:50:17] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 0 ms to minimize.
[2023-03-15 04:50:17] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 0 ms to minimize.
[2023-03-15 04:50:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-03-15 04:50:17] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-15 04:50:22] [INFO ] Deduced a trap composed of 7 places in 1103 ms of which 2 ms to minimize.
[2023-03-15 04:50:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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-15 04:50:22] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2023-03-15 04:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:23] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2023-03-15 04:50:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:50:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 52 ms returned sat
[2023-03-15 04:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:24] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2023-03-15 04:50:25] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 1 ms to minimize.
[2023-03-15 04:50:25] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 0 ms to minimize.
[2023-03-15 04:50:25] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 1 ms to minimize.
[2023-03-15 04:50:25] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 0 ms to minimize.
[2023-03-15 04:50:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 885 ms
[2023-03-15 04:50:25] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 120 ms.
[2023-03-15 04:50:29] [INFO ] Deduced a trap composed of 7 places in 1033 ms of which 2 ms to minimize.
[2023-03-15 04:50:29] [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.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-15 04:50:29] [INFO ] [Real]Absence check using 40 positive place invariants in 52 ms returned sat
[2023-03-15 04:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:30] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2023-03-15 04:50:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:50:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 54 ms returned sat
[2023-03-15 04:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:50:31] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2023-03-15 04:50:32] [INFO ] Deduced a trap composed of 95 places in 166 ms of which 1 ms to minimize.
[2023-03-15 04:50:32] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2023-03-15 04:50:32] [INFO ] Deduced a trap composed of 140 places in 99 ms of which 0 ms to minimize.
[2023-03-15 04:50:32] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2023-03-15 04:50:32] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 0 ms to minimize.
[2023-03-15 04:50:32] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2023-03-15 04:50:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1070 ms
[2023-03-15 04:50:33] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 111 ms.
[2023-03-15 04:50:35] [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 5
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, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-1B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1440 edges and 1416 vertex of which 916 / 1416 are part of one of the 20 SCC in 13 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 168 places :
Symmetric choice reduction at 2 with 168 rule applications. Total rules 209 place count 332 transition count 368
Iterating global reduction 2 with 168 rules applied. Total rules applied 377 place count 332 transition count 368
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 377 place count 332 transition count 331
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 451 place count 295 transition count 331
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 479 place count 267 transition count 290
Iterating global reduction 2 with 28 rules applied. Total rules applied 507 place count 267 transition count 290
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 623 place count 209 transition count 232
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 625 place count 208 transition count 243
Free-agglomeration rule applied 107 times.
Iterating global reduction 2 with 107 rules applied. Total rules applied 732 place count 208 transition count 136
Reduce places removed 107 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 266 edges and 101 vertex of which 12 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.2 ms
Discarding 89 places :
Also discarding 93 output transitions
Drop transitions removed 93 transitions
Iterating post reduction 2 with 128 rules applied. Total rules applied 860 place count 12 transition count 23
Drop transitions removed 10 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 873 place count 12 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 874 place count 11 transition count 9
Reduce places removed 4 places and 0 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 6 rules applied. Total rules applied 880 place count 7 transition count 7
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 883 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 884 place count 5 transition count 5
Applied a total of 884 rules in 201 ms. Remains 5 /1416 variables (removed 1411) and now considering 5/1640 (removed 1635) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 5/1416 places, 5/1640 transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-15 04:50:36] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 2) seen :2
FORMULA NoC3x3-PT-1B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 44983 ms.
ITS solved all properties within timeout

BK_STOP 1678855838449

--------------------
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-1B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
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 r265-smll-167863539800237"
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 ;