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.r222-tall-165286025000269.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 itstools
Input is ShieldIIPt-PT-010B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 9.3K Apr 29 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 29 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 167K 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 ShieldIIPt-PT-010B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652956246750

Running Version 202205111006
[2022-05-19 10:30:47] [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 10:30:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 10:30:48] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-05-19 10:30:48] [INFO ] Transformed 703 places.
[2022-05-19 10:30:48] [INFO ] Transformed 653 transitions.
[2022-05-19 10:30:48] [INFO ] Found NUPN structural information;
[2022-05-19 10:30:48] [INFO ] Parsed PT model containing 703 places and 653 transitions in 223 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 653 rows 703 cols
[2022-05-19 10:30:48] [INFO ] Computed 91 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :13
FORMULA ShieldIIPt-PT-010B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
// Phase 1: matrix 653 rows 703 cols
[2022-05-19 10:30:48] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-19 10:30:48] [INFO ] [Real]Absence check using 91 positive place invariants in 29 ms returned sat
[2022-05-19 10:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:48] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-19 10:30:49] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 12 ms to minimize.
[2022-05-19 10:30:49] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2022-05-19 10:30:49] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2022-05-19 10:30:49] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2022-05-19 10:30:49] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2022-05-19 10:30:49] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2022-05-19 10:30:50] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2022-05-19 10:30:50] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2022-05-19 10:30:50] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2022-05-19 10:30:50] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2022-05-19 10:30:50] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2022-05-19 10:30:50] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2022-05-19 10:30:50] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2022-05-19 10:30:51] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2022-05-19 10:30:52] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-05-19 10:30:52] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-19 10:30:52] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3358 ms
[2022-05-19 10:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:30:52] [INFO ] [Nat]Absence check using 91 positive place invariants in 34 ms returned sat
[2022-05-19 10:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:52] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2022-05-19 10:30:52] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-05-19 10:30:52] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-19 10:30:53] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2022-05-19 10:30:53] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2022-05-19 10:30:53] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-05-19 10:30:53] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2022-05-19 10:30:53] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2022-05-19 10:30:53] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 1 ms to minimize.
[2022-05-19 10:30:53] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2022-05-19 10:30:54] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1987 ms
[2022-05-19 10:30:54] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-19 10:30:57] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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)
[2022-05-19 10:30:57] [INFO ] [Real]Absence check using 91 positive place invariants in 26 ms returned sat
[2022-05-19 10:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:57] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-19 10:30:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:30:57] [INFO ] [Nat]Absence check using 91 positive place invariants in 28 ms returned sat
[2022-05-19 10:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:30:57] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2022-05-19 10:30:58] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 0 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2022-05-19 10:30:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1976 ms
[2022-05-19 10:30:59] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-19 10:31:02] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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)
[2022-05-19 10:31:02] [INFO ] [Real]Absence check using 91 positive place invariants in 26 ms returned sat
[2022-05-19 10:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:31:02] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-19 10:31:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:31:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 26 ms returned sat
[2022-05-19 10:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:31:03] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-05-19 10:31:03] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2022-05-19 10:31:03] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2022-05-19 10:31:03] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2022-05-19 10:31:03] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2022-05-19 10:31:03] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2022-05-19 10:31:04] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2022-05-19 10:31:04] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2022-05-19 10:31:04] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2022-05-19 10:31:04] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2022-05-19 10:31:04] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2022-05-19 10:31:04] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2022-05-19 10:31:04] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2022-05-19 10:31:05] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2602 ms
[2022-05-19 10:31:05] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-19 10:31:08] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 1 ms to minimize.
[2022-05-19 10:31:08] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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: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] Max seen :[0, 0, 0]
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 170 place count 703 transition count 483
Reduce places removed 170 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 172 rules applied. Total rules applied 342 place count 533 transition count 481
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 345 place count 532 transition count 479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 347 place count 530 transition count 479
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 347 place count 530 transition count 438
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 429 place count 489 transition count 438
Discarding 70 places :
Symmetric choice reduction at 4 with 70 rule applications. Total rules 499 place count 419 transition count 368
Iterating global reduction 4 with 70 rules applied. Total rules applied 569 place count 419 transition count 368
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 569 place count 419 transition count 338
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 629 place count 389 transition count 338
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 965 place count 221 transition count 170
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1023 place count 192 transition count 189
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1024 place count 192 transition count 188
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1032 place count 192 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1033 place count 191 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1035 place count 189 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1035 place count 189 transition count 186
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 1037 place count 188 transition count 186
Applied a total of 1037 rules in 141 ms. Remains 188 /703 variables (removed 515) and now considering 186/653 (removed 467) transitions.
Finished structural reductions, in 1 iterations. Remains : 188/703 places, 186/653 transitions.
// Phase 1: matrix 186 rows 188 cols
[2022-05-19 10:31:08] [INFO ] Computed 89 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2926 ms. (steps per millisecond=341 ) properties (out of 3) seen :3
FORMULA ShieldIIPt-PT-010B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23394 ms.

BK_STOP 1652956271302

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-010B, 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 r222-tall-165286025000269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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