fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r395-oct2-167903718600301
Last Updated
May 14, 2023

About the Execution of Smart+red for ShieldIIPt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1005.859 82732.00 108964.00 81.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r395-oct2-167903718600301.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPt-PT-030B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 512K 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 ShieldIIPt-PT-030B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679561010072

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:43:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 08:43:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:43:33] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-23 08:43:33] [INFO ] Transformed 2103 places.
[2023-03-23 08:43:33] [INFO ] Transformed 1953 transitions.
[2023-03-23 08:43:33] [INFO ] Found NUPN structural information;
[2023-03-23 08:43:33] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-23 08:43:33] [INFO ] Computed 271 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 16) seen :10
FORMULA ShieldIIPt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) 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 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
[2023-03-23 08:43:33] [INFO ] Invariant cache hit.
[2023-03-23 08:43:35] [INFO ] [Real]Absence check using 271 positive place invariants in 269 ms returned sat
[2023-03-23 08:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:36] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2023-03-23 08:43:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:43:37] [INFO ] [Nat]Absence check using 271 positive place invariants in 116 ms returned sat
[2023-03-23 08:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:38] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2023-03-23 08:43:39] [INFO ] Deduced a trap composed of 35 places in 745 ms of which 7 ms to minimize.
[2023-03-23 08:43:40] [INFO ] Deduced a trap composed of 17 places in 996 ms of which 1 ms to minimize.
[2023-03-23 08:43:42] [INFO ] Deduced a trap composed of 18 places in 1166 ms of which 17 ms to minimize.
[2023-03-23 08:43:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 08:43:42] [INFO ] [Real]Absence check using 271 positive place invariants in 126 ms returned sat
[2023-03-23 08:43:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:43] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2023-03-23 08:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:43:44] [INFO ] [Nat]Absence check using 271 positive place invariants in 289 ms returned sat
[2023-03-23 08:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:45] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2023-03-23 08:43:46] [INFO ] Deduced a trap composed of 12 places in 685 ms of which 3 ms to minimize.
[2023-03-23 08:43:47] [INFO ] Deduced a trap composed of 21 places in 600 ms of which 2 ms to minimize.
[2023-03-23 08:43:47] [INFO ] Deduced a trap composed of 38 places in 537 ms of which 1 ms to minimize.
[2023-03-23 08:43:48] [INFO ] Deduced a trap composed of 18 places in 623 ms of which 1 ms to minimize.
[2023-03-23 08:43:49] [INFO ] Deduced a trap composed of 29 places in 550 ms of which 1 ms to minimize.
[2023-03-23 08:43: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 08:43:49] [INFO ] [Real]Absence check using 271 positive place invariants in 128 ms returned sat
[2023-03-23 08:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:50] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2023-03-23 08:43:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:43:51] [INFO ] [Nat]Absence check using 271 positive place invariants in 116 ms returned sat
[2023-03-23 08:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:52] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2023-03-23 08:43:52] [INFO ] Deduced a trap composed of 34 places in 638 ms of which 4 ms to minimize.
[2023-03-23 08:43:53] [INFO ] Deduced a trap composed of 33 places in 601 ms of which 2 ms to minimize.
[2023-03-23 08:43:54] [INFO ] Deduced a trap composed of 24 places in 594 ms of which 2 ms to minimize.
[2023-03-23 08:43:54] [INFO ] Deduced a trap composed of 27 places in 498 ms of which 2 ms to minimize.
[2023-03-23 08:43:55] [INFO ] Deduced a trap composed of 33 places in 585 ms of which 1 ms to minimize.
[2023-03-23 08:43:56] [INFO ] Deduced a trap composed of 19 places in 669 ms of which 1 ms to minimize.
[2023-03-23 08:43: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 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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 08:43:56] [INFO ] [Real]Absence check using 271 positive place invariants in 152 ms returned sat
[2023-03-23 08:43:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:57] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2023-03-23 08:43:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:43:58] [INFO ] [Nat]Absence check using 271 positive place invariants in 197 ms returned sat
[2023-03-23 08:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:43:59] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2023-03-23 08:44:00] [INFO ] Deduced a trap composed of 20 places in 556 ms of which 1 ms to minimize.
[2023-03-23 08:44:01] [INFO ] Deduced a trap composed of 18 places in 617 ms of which 2 ms to minimize.
[2023-03-23 08:44:01] [INFO ] Deduced a trap composed of 24 places in 646 ms of which 2 ms to minimize.
[2023-03-23 08:44:02] [INFO ] Deduced a trap composed of 21 places in 542 ms of which 2 ms to minimize.
[2023-03-23 08:44:03] [INFO ] Deduced a trap composed of 18 places in 624 ms of which 2 ms to minimize.
[2023-03-23 08:44:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 08:44:03] [INFO ] [Real]Absence check using 271 positive place invariants in 114 ms returned sat
[2023-03-23 08:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:04] [INFO ] [Real]Absence check using state equation in 1029 ms returned sat
[2023-03-23 08:44:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:44:05] [INFO ] [Nat]Absence check using 271 positive place invariants in 114 ms returned sat
[2023-03-23 08:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:06] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2023-03-23 08:44:07] [INFO ] Deduced a trap composed of 26 places in 532 ms of which 1 ms to minimize.
[2023-03-23 08:44:07] [INFO ] Deduced a trap composed of 27 places in 588 ms of which 15 ms to minimize.
[2023-03-23 08:44:08] [INFO ] Deduced a trap composed of 21 places in 642 ms of which 2 ms to minimize.
[2023-03-23 08:44:09] [INFO ] Deduced a trap composed of 34 places in 649 ms of which 2 ms to minimize.
[2023-03-23 08:44:10] [INFO ] Deduced a trap composed of 19 places in 784 ms of which 1 ms to minimize.
[2023-03-23 08:44:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 08:44:10] [INFO ] [Real]Absence check using 271 positive place invariants in 135 ms returned sat
[2023-03-23 08:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:12] [INFO ] [Real]Absence check using state equation in 1625 ms returned sat
[2023-03-23 08:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:44:13] [INFO ] [Nat]Absence check using 271 positive place invariants in 111 ms returned sat
[2023-03-23 08:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:14] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2023-03-23 08:44:15] [INFO ] Deduced a trap composed of 32 places in 760 ms of which 2 ms to minimize.
[2023-03-23 08:44:15] [INFO ] Deduced a trap composed of 22 places in 745 ms of which 2 ms to minimize.
[2023-03-23 08:44:16] [INFO ] Deduced a trap composed of 37 places in 848 ms of which 2 ms to minimize.
[2023-03-23 08:44:17] [INFO ] Deduced a trap composed of 23 places in 790 ms of which 2 ms to minimize.
[2023-03-23 08:44:17] [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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
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 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 508 place count 2103 transition count 1445
Reduce places removed 508 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 510 rules applied. Total rules applied 1018 place count 1595 transition count 1443
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 1020 place count 1594 transition count 1442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1021 place count 1593 transition count 1442
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 121 Pre rules applied. Total rules applied 1021 place count 1593 transition count 1321
Deduced a syphon composed of 121 places in 4 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1263 place count 1472 transition count 1321
Discarding 209 places :
Symmetric choice reduction at 4 with 209 rule applications. Total rules 1472 place count 1263 transition count 1112
Iterating global reduction 4 with 209 rules applied. Total rules applied 1681 place count 1263 transition count 1112
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 90 Pre rules applied. Total rules applied 1681 place count 1263 transition count 1022
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 1861 place count 1173 transition count 1022
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 2 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 4 with 1016 rules applied. Total rules applied 2877 place count 665 transition count 514
Renaming transitions due to excessive name length > 1024 char.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 3049 place count 579 transition count 569
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3050 place count 579 transition count 568
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3051 place count 579 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3052 place count 578 transition count 567
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 3081 place count 578 transition count 567
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3082 place count 577 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3084 place count 575 transition count 566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3084 place count 575 transition count 565
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3086 place count 574 transition count 565
Applied a total of 3086 rules in 663 ms. Remains 574 /2103 variables (removed 1529) and now considering 565/1953 (removed 1388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 664 ms. Remains : 574/2103 places, 565/1953 transitions.
// Phase 1: matrix 565 rows 574 cols
[2023-03-23 08:44:18] [INFO ] Computed 269 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5738 ms. (steps per millisecond=174 ) properties (out of 6) seen :3
FORMULA ShieldIIPt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3457 ms. (steps per millisecond=289 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3593 ms. (steps per millisecond=278 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3409 ms. (steps per millisecond=293 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-23 08:44:34] [INFO ] Invariant cache hit.
[2023-03-23 08:44:34] [INFO ] [Real]Absence check using 269 positive place invariants in 54 ms returned sat
[2023-03-23 08:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:35] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2023-03-23 08:44:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:44:35] [INFO ] [Nat]Absence check using 269 positive place invariants in 114 ms returned sat
[2023-03-23 08:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:35] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-23 08:44:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 08:44:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 08:44:36] [INFO ] Computed and/alt/rep : 562/1003/562 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-23 08:44:42] [INFO ] Added : 500 causal constraints over 101 iterations in 6825 ms. Result :sat
Minimization took 284 ms.
[2023-03-23 08:44:43] [INFO ] [Real]Absence check using 269 positive place invariants in 439 ms returned sat
[2023-03-23 08:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:43] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2023-03-23 08:44:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:44:44] [INFO ] [Nat]Absence check using 269 positive place invariants in 49 ms returned sat
[2023-03-23 08:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:44:44] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-23 08:44:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2023-03-23 08:44:44] [INFO ] Computed and/alt/rep : 562/1003/562 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-23 08:44:50] [INFO ] Added : 505 causal constraints over 102 iterations in 6203 ms. Result :sat
Minimization took 612 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ShieldIIPt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 79556 ms.
ITS solved all properties within timeout

BK_STOP 1679561092804

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldIIPt-PT-030B, 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 r395-oct2-167903718600301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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