Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 548K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-2B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652989524336

Running Version 0
[2022-05-19 19:45:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 19:45:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:45:28] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2022-05-19 19:45:28] [INFO ] Transformed 2003 places.
[2022-05-19 19:45:28] [INFO ] Transformed 2292 transitions.
[2022-05-19 19:45:28] [INFO ] Found NUPN structural information;
[2022-05-19 19:45:28] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 509 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 2292 rows 2003 cols
[2022-05-19 19:45:28] [INFO ] Computed 66 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-2B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
// Phase 1: matrix 2292 rows 2003 cols
[2022-05-19 19:45:28] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-19 19:45:29] [INFO ] [Real]Absence check using 66 positive place invariants in 108 ms returned sat
[2022-05-19 19:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:31] [INFO ] [Real]Absence check using state equation in 1731 ms returned sat
[2022-05-19 19:45:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:45:32] [INFO ] [Nat]Absence check using 66 positive place invariants in 92 ms returned sat
[2022-05-19 19:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:34] [INFO ] [Nat]Absence check using state equation in 1688 ms returned sat
[2022-05-19 19:45:35] [INFO ] Deduced a trap composed of 31 places in 1176 ms of which 8 ms to minimize.
[2022-05-19 19:45:36] [INFO ] Deduced a trap composed of 28 places in 1124 ms of which 4 ms to minimize.
[2022-05-19 19:45:39] [INFO ] Deduced a trap composed of 7 places in 2118 ms of which 6 ms to minimize.
[2022-05-19 19:45:39] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:45:39] [INFO ] [Real]Absence check using 66 positive place invariants in 83 ms returned sat
[2022-05-19 19:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:41] [INFO ] [Real]Absence check using state equation in 1563 ms returned sat
[2022-05-19 19:45:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:45:41] [INFO ] [Nat]Absence check using 66 positive place invariants in 84 ms returned sat
[2022-05-19 19:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:43] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2022-05-19 19:45:44] [INFO ] Deduced a trap composed of 32 places in 737 ms of which 2 ms to minimize.
[2022-05-19 19:45:45] [INFO ] Deduced a trap composed of 101 places in 722 ms of which 3 ms to minimize.
[2022-05-19 19:45:45] [INFO ] Deduced a trap composed of 97 places in 700 ms of which 2 ms to minimize.
[2022-05-19 19:45:46] [INFO ] Deduced a trap composed of 103 places in 775 ms of which 1 ms to minimize.
[2022-05-19 19:45:46] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:45:47] [INFO ] [Real]Absence check using 66 positive place invariants in 126 ms returned sat
[2022-05-19 19:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:49] [INFO ] [Real]Absence check using state equation in 1516 ms returned sat
[2022-05-19 19:45:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:45:49] [INFO ] [Nat]Absence check using 66 positive place invariants in 147 ms returned sat
[2022-05-19 19:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:51] [INFO ] [Nat]Absence check using state equation in 1511 ms returned sat
[2022-05-19 19:45:52] [INFO ] Deduced a trap composed of 57 places in 905 ms of which 3 ms to minimize.
[2022-05-19 19:45:53] [INFO ] Deduced a trap composed of 48 places in 882 ms of which 2 ms to minimize.
[2022-05-19 19:45:54] [INFO ] Deduced a trap composed of 83 places in 726 ms of which 1 ms to minimize.
[2022-05-19 19:45:54] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:45:55] [INFO ] [Real]Absence check using 66 positive place invariants in 111 ms returned sat
[2022-05-19 19:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:56] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2022-05-19 19:45:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:45:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 114 ms returned sat
[2022-05-19 19:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:45:58] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2022-05-19 19:45:59] [INFO ] Deduced a trap composed of 28 places in 567 ms of which 2 ms to minimize.
[2022-05-19 19:46:00] [INFO ] Deduced a trap composed of 62 places in 469 ms of which 2 ms to minimize.
[2022-05-19 19:46:00] [INFO ] Deduced a trap composed of 95 places in 492 ms of which 1 ms to minimize.
[2022-05-19 19:46:01] [INFO ] Deduced a trap composed of 87 places in 360 ms of which 1 ms to minimize.
[2022-05-19 19:46:01] [INFO ] Deduced a trap composed of 79 places in 285 ms of which 1 ms to minimize.
[2022-05-19 19:46:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2950 ms
[2022-05-19 19:46:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:46:02] [INFO ] [Real]Absence check using 66 positive place invariants in 94 ms returned sat
[2022-05-19 19:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:04] [INFO ] [Real]Absence check using state equation in 1466 ms returned sat
[2022-05-19 19:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:46:04] [INFO ] [Nat]Absence check using 66 positive place invariants in 136 ms returned sat
[2022-05-19 19:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:06] [INFO ] [Nat]Absence check using state equation in 1498 ms returned sat
[2022-05-19 19:46:06] [INFO ] Deduced a trap composed of 77 places in 362 ms of which 1 ms to minimize.
[2022-05-19 19:46:07] [INFO ] Deduced a trap composed of 87 places in 384 ms of which 1 ms to minimize.
[2022-05-19 19:46:07] [INFO ] Deduced a trap composed of 77 places in 397 ms of which 1 ms to minimize.
[2022-05-19 19:46:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1584 ms
[2022-05-19 19:46:08] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 218 ms.
[2022-05-19 19:46:11] [INFO ] Deduced a trap composed of 7 places in 2161 ms of which 3 ms to minimize.
[2022-05-19 19:46:11] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-19 19:46:12] [INFO ] [Real]Absence check using 66 positive place invariants in 115 ms returned sat
[2022-05-19 19:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:13] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2022-05-19 19:46:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:46:13] [INFO ] [Nat]Absence check using 66 positive place invariants in 96 ms returned sat
[2022-05-19 19:46:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:46:15] [INFO ] [Nat]Absence check using state equation in 1627 ms returned sat
[2022-05-19 19:46:16] [INFO ] Deduced a trap composed of 39 places in 698 ms of which 1 ms to minimize.
[2022-05-19 19:46:16] [INFO ] Deduced a trap composed of 28 places in 634 ms of which 2 ms to minimize.
[2022-05-19 19:46:17] [INFO ] Deduced a trap composed of 64 places in 639 ms of which 1 ms to minimize.
[2022-05-19 19:46:18] [INFO ] Deduced a trap composed of 32 places in 600 ms of which 1 ms to minimize.
[2022-05-19 19:46: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
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 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1626 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 11 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 410 rules applied. Total rules applied 411 place count 1931 transition count 1819
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 812 place count 1530 transition count 1819
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 812 place count 1530 transition count 1795
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 860 place count 1506 transition count 1795
Discarding 347 places :
Symmetric choice reduction at 2 with 347 rule applications. Total rules 1207 place count 1159 transition count 1448
Iterating global reduction 2 with 347 rules applied. Total rules applied 1554 place count 1159 transition count 1448
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 1554 place count 1159 transition count 1407
Deduced a syphon composed of 41 places in 12 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1636 place count 1118 transition count 1407
Discarding 131 places :
Symmetric choice reduction at 2 with 131 rule applications. Total rules 1767 place count 987 transition count 1236
Iterating global reduction 2 with 131 rules applied. Total rules applied 1898 place count 987 transition count 1236
Discarding 123 places :
Symmetric choice reduction at 2 with 123 rule applications. Total rules 2021 place count 864 transition count 1099
Iterating global reduction 2 with 123 rules applied. Total rules applied 2144 place count 864 transition count 1099
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 2190 place count 818 transition count 1019
Iterating global reduction 2 with 46 rules applied. Total rules applied 2236 place count 818 transition count 1019
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 2 with 18 rules applied. Total rules applied 2254 place count 816 transition count 1003
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2256 place count 814 transition count 1003
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 2288 place count 782 transition count 971
Iterating global reduction 4 with 32 rules applied. Total rules applied 2320 place count 782 transition count 971
Discarding 2 places :
Implicit places reduction removed 2 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 4 rules applied. Total rules applied 2324 place count 780 transition count 969
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2326 place count 778 transition count 969
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 2346 place count 758 transition count 929
Iterating global reduction 6 with 20 rules applied. Total rules applied 2366 place count 758 transition count 929
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 2386 place count 738 transition count 909
Iterating global reduction 6 with 20 rules applied. Total rules applied 2406 place count 738 transition count 909
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 26 rules applied. Total rules applied 2432 place count 735 transition count 886
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2435 place count 732 transition count 886
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Deduced a syphon composed of 306 places in 1 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 8 with 612 rules applied. Total rules applied 3047 place count 426 transition count 580
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 3059 place count 414 transition count 568
Iterating global reduction 8 with 12 rules applied. Total rules applied 3071 place count 414 transition count 568
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3080 place count 405 transition count 550
Iterating global reduction 8 with 9 rules applied. Total rules applied 3089 place count 405 transition count 550
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3091 place count 403 transition count 546
Iterating global reduction 8 with 2 rules applied. Total rules applied 3093 place count 403 transition count 546
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 3125 place count 387 transition count 569
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 3148 place count 387 transition count 546
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 3178 place count 364 transition count 539
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3179 place count 364 transition count 538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3180 place count 363 transition count 538
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3181 place count 363 transition count 538
Applied a total of 3181 rules in 1016 ms. Remains 363 /2003 variables (removed 1640) and now considering 538/2292 (removed 1754) transitions.
Finished structural reductions, in 1 iterations. Remains : 363/2003 places, 538/2292 transitions.
// Phase 1: matrix 538 rows 363 cols
[2022-05-19 19:46:19] [INFO ] Computed 53 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 13928 resets, run finished after 4782 ms. (steps per millisecond=209 ) properties (out of 6) seen :6
FORMULA NoC3x3-PT-2B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652989585332

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-2B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is NoC3x3-PT-2B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r161-smll-165277002700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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