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.r263-smll-167863537900237.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 lolaxred
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 r263-smll-167863537900237
=====================================================================

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

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 23:49:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 23:49:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:49:26] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2023-03-13 23:49:26] [INFO ] Transformed 1416 places.
[2023-03-13 23:49:26] [INFO ] Transformed 1640 transitions.
[2023-03-13 23:49:26] [INFO ] Found NUPN structural information;
[2023-03-13 23:49:26] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-13 23:49:27] [INFO ] Computed 40 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 72 ms. (steps per millisecond=138 ) 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-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :2
FORMULA NoC3x3-PT-1B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 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 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
[2023-03-13 23:49:27] [INFO ] Invariant cache hit.
[2023-03-13 23:49:28] [INFO ] [Real]Absence check using 40 positive place invariants in 89 ms returned sat
[2023-03-13 23:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:29] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2023-03-13 23:49:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 84 ms returned sat
[2023-03-13 23:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:31] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2023-03-13 23:49:31] [INFO ] Deduced a trap composed of 102 places in 249 ms of which 6 ms to minimize.
[2023-03-13 23:49:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2023-03-13 23:49:32] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 238 ms.
[2023-03-13 23:49:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:49:35] [INFO ] [Real]Absence check using 40 positive place invariants in 81 ms returned sat
[2023-03-13 23:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:36] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2023-03-13 23:49:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 81 ms returned sat
[2023-03-13 23:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:38] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2023-03-13 23:49:38] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 1 ms to minimize.
[2023-03-13 23:49:38] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2023-03-13 23:49:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-03-13 23:49:38] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-13 23:49:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:49:42] [INFO ] [Real]Absence check using 40 positive place invariants in 85 ms returned sat
[2023-03-13 23:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:43] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2023-03-13 23:49:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 78 ms returned sat
[2023-03-13 23:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:45] [INFO ] [Nat]Absence check using state equation in 1019 ms returned sat
[2023-03-13 23:49:45] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 117 ms.
[2023-03-13 23:49:49] [INFO ] Deduced a trap composed of 7 places in 1377 ms of which 3 ms to minimize.
[2023-03-13 23:49:49] [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-13 23:49:50] [INFO ] [Real]Absence check using 40 positive place invariants in 74 ms returned sat
[2023-03-13 23:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:51] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-13 23:49:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 80 ms returned sat
[2023-03-13 23:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:53] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2023-03-13 23:49:53] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 2 ms to minimize.
[2023-03-13 23:49:53] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 1 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 1 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2023-03-13 23:49:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 909 ms
[2023-03-13 23:49:54] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 162 ms.
[2023-03-13 23:49:56] [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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:49:57] [INFO ] [Real]Absence check using 40 positive place invariants in 78 ms returned sat
[2023-03-13 23:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:49:58] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2023-03-13 23:49:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:49:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 72 ms returned sat
[2023-03-13 23:49:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:00] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2023-03-13 23:50:00] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 1 ms to minimize.
[2023-03-13 23:50:00] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 1 ms to minimize.
[2023-03-13 23:50:00] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 0 ms to minimize.
[2023-03-13 23:50:00] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 1 ms to minimize.
[2023-03-13 23:50:01] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 1 ms to minimize.
[2023-03-13 23:50:01] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2023-03-13 23:50:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1362 ms
[2023-03-13 23:50:01] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 180 ms.
[2023-03-13 23:50:05] [INFO ] Deduced a trap composed of 7 places in 1274 ms of which 2 ms to minimize.
[2023-03-13 23:50:05] [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-13 23:50:05] [INFO ] [Real]Absence check using 40 positive place invariants in 74 ms returned sat
[2023-03-13 23:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:06] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2023-03-13 23:50:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:50:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 80 ms returned sat
[2023-03-13 23:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:50:07] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 1 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 1 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2023-03-13 23:50:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 712 ms
[2023-03-13 23:50:08] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 179 ms.
[2023-03-13 23:50:13] [INFO ] Deduced a trap composed of 7 places in 1477 ms of which 2 ms to minimize.
[2023-03-13 23:50:13] [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.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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1436 edges and 1416 vertex of which 914 / 1416 are part of one of the 20 SCC in 14 ms
Free SCC test removed 894 places
Drop transitions removed 1081 transitions
Reduce isomorphic transitions removed 1081 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 522 transition count 539
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 502 transition count 539
Discarding 167 places :
Symmetric choice reduction at 2 with 167 rule applications. Total rules 208 place count 335 transition count 372
Iterating global reduction 2 with 167 rules applied. Total rules applied 375 place count 335 transition count 372
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 375 place count 335 transition count 337
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 445 place count 300 transition count 337
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 471 place count 274 transition count 299
Iterating global reduction 2 with 26 rules applied. Total rules applied 497 place count 274 transition count 299
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 617 place count 214 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 618 place count 213 transition count 237
Iterating global reduction 2 with 1 rules applied. Total rules applied 619 place count 213 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 621 place count 212 transition count 248
Free-agglomeration rule applied 107 times.
Iterating global reduction 2 with 107 rules applied. Total rules applied 728 place count 212 transition count 141
Reduce places removed 107 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 273 edges and 105 vertex of which 40 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.2 ms
Discarding 65 places :
Also discarding 47 output transitions
Drop transitions removed 47 transitions
Iterating post reduction 2 with 128 rules applied. Total rules applied 856 place count 40 transition count 74
Drop transitions removed 35 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 894 place count 40 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 895 place count 39 transition count 35
Reduce places removed 11 places and 0 transitions.
Graph (trivial) has 20 edges and 28 vertex of which 12 / 28 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 14 rules applied. Total rules applied 909 place count 19 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 927 place count 17 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 927 place count 17 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 929 place count 16 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 930 place count 16 transition count 15
Applied a total of 930 rules in 280 ms. Remains 16 /1416 variables (removed 1400) and now considering 15/1640 (removed 1625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 16/1416 places, 15/1640 transitions.
// Phase 1: matrix 15 rows 16 cols
[2023-03-13 23:50:13] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 6) seen :6
FORMULA NoC3x3-PT-1B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 47812 ms.
ITS solved all properties within timeout

BK_STOP 1678751415466

--------------------
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="lolaxred"
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 lolaxred"
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 r263-smll-167863537900237"
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 ;