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.r389-oct2-167903713400301.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 itstools
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 r389-oct2-167903713400301
=====================================================================

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

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 00:54:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:54:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:54:09] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-19 00:54:09] [INFO ] Transformed 2103 places.
[2023-03-19 00:54:09] [INFO ] Transformed 1953 transitions.
[2023-03-19 00:54:09] [INFO ] Found NUPN structural information;
[2023-03-19 00:54:09] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-19 00:54:10] [INFO ] Computed 271 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :8
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-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 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
[2023-03-19 00:54:10] [INFO ] Invariant cache hit.
[2023-03-19 00:54:11] [INFO ] [Real]Absence check using 271 positive place invariants in 190 ms returned sat
[2023-03-19 00:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:12] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2023-03-19 00:54:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:54:13] [INFO ] [Nat]Absence check using 271 positive place invariants in 104 ms returned sat
[2023-03-19 00:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:14] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2023-03-19 00:54:14] [INFO ] Deduced a trap composed of 35 places in 623 ms of which 4 ms to minimize.
[2023-03-19 00:54:15] [INFO ] Deduced a trap composed of 17 places in 628 ms of which 2 ms to minimize.
[2023-03-19 00:54:16] [INFO ] Deduced a trap composed of 18 places in 703 ms of which 4 ms to minimize.
[2023-03-19 00:54:17] [INFO ] Deduced a trap composed of 32 places in 873 ms of which 2 ms to minimize.
[2023-03-19 00:54:18] [INFO ] Deduced a trap composed of 18 places in 666 ms of which 16 ms to minimize.
[2023-03-19 00:54: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 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-19 00:54:18] [INFO ] [Real]Absence check using 271 positive place invariants in 139 ms returned sat
[2023-03-19 00:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:19] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2023-03-19 00:54:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:54:20] [INFO ] [Nat]Absence check using 271 positive place invariants in 143 ms returned sat
[2023-03-19 00:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:21] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2023-03-19 00:54:21] [INFO ] Deduced a trap composed of 12 places in 580 ms of which 2 ms to minimize.
[2023-03-19 00:54:22] [INFO ] Deduced a trap composed of 21 places in 625 ms of which 4 ms to minimize.
[2023-03-19 00:54:23] [INFO ] Deduced a trap composed of 38 places in 663 ms of which 1 ms to minimize.
[2023-03-19 00:54:23] [INFO ] Deduced a trap composed of 18 places in 579 ms of which 2 ms to minimize.
[2023-03-19 00:54:24] [INFO ] Deduced a trap composed of 29 places in 560 ms of which 1 ms to minimize.
[2023-03-19 00:54:25] [INFO ] Deduced a trap composed of 24 places in 539 ms of which 2 ms to minimize.
[2023-03-19 00:54:25] [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-19 00:54:25] [INFO ] [Real]Absence check using 271 positive place invariants in 106 ms returned sat
[2023-03-19 00:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:26] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2023-03-19 00:54:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:54:27] [INFO ] [Nat]Absence check using 271 positive place invariants in 143 ms returned sat
[2023-03-19 00:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:28] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2023-03-19 00:54:28] [INFO ] Deduced a trap composed of 34 places in 545 ms of which 2 ms to minimize.
[2023-03-19 00:54:29] [INFO ] Deduced a trap composed of 33 places in 597 ms of which 1 ms to minimize.
[2023-03-19 00:54:30] [INFO ] Deduced a trap composed of 24 places in 526 ms of which 2 ms to minimize.
[2023-03-19 00:54:30] [INFO ] Deduced a trap composed of 27 places in 503 ms of which 1 ms to minimize.
[2023-03-19 00:54:31] [INFO ] Deduced a trap composed of 33 places in 515 ms of which 2 ms to minimize.
[2023-03-19 00:54:32] [INFO ] Deduced a trap composed of 19 places in 580 ms of which 1 ms to minimize.
[2023-03-19 00:54:32] [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-19 00:54:32] [INFO ] [Real]Absence check using 271 positive place invariants in 99 ms returned sat
[2023-03-19 00:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:33] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2023-03-19 00:54:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:54:33] [INFO ] [Nat]Absence check using 271 positive place invariants in 98 ms returned sat
[2023-03-19 00:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:34] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2023-03-19 00:54:35] [INFO ] Deduced a trap composed of 20 places in 599 ms of which 1 ms to minimize.
[2023-03-19 00:54:36] [INFO ] Deduced a trap composed of 18 places in 685 ms of which 1 ms to minimize.
[2023-03-19 00:54:36] [INFO ] Deduced a trap composed of 24 places in 518 ms of which 1 ms to minimize.
[2023-03-19 00:54:37] [INFO ] Deduced a trap composed of 21 places in 544 ms of which 1 ms to minimize.
[2023-03-19 00:54:38] [INFO ] Deduced a trap composed of 18 places in 477 ms of which 1 ms to minimize.
[2023-03-19 00:54:38] [INFO ] Deduced a trap composed of 22 places in 460 ms of which 1 ms to minimize.
[2023-03-19 00:54:38] [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-19 00:54:39] [INFO ] [Real]Absence check using 271 positive place invariants in 105 ms returned sat
[2023-03-19 00:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:40] [INFO ] [Real]Absence check using state equation in 924 ms returned sat
[2023-03-19 00:54:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:54:40] [INFO ] [Nat]Absence check using 271 positive place invariants in 106 ms returned sat
[2023-03-19 00:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:41] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2023-03-19 00:54:42] [INFO ] Deduced a trap composed of 23 places in 544 ms of which 2 ms to minimize.
[2023-03-19 00:54:42] [INFO ] Deduced a trap composed of 17 places in 526 ms of which 1 ms to minimize.
[2023-03-19 00:54:43] [INFO ] Deduced a trap composed of 38 places in 568 ms of which 1 ms to minimize.
[2023-03-19 00:54:44] [INFO ] Deduced a trap composed of 22 places in 571 ms of which 2 ms to minimize.
[2023-03-19 00:54:44] [INFO ] Deduced a trap composed of 18 places in 507 ms of which 2 ms to minimize.
[2023-03-19 00:54:45] [INFO ] Deduced a trap composed of 18 places in 578 ms of which 1 ms to minimize.
[2023-03-19 00:54:45] [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-19 00:54:45] [INFO ] [Real]Absence check using 271 positive place invariants in 103 ms returned sat
[2023-03-19 00:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:46] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2023-03-19 00:54:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:54:47] [INFO ] [Nat]Absence check using 271 positive place invariants in 108 ms returned sat
[2023-03-19 00:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:48] [INFO ] [Nat]Absence check using state equation in 996 ms returned sat
[2023-03-19 00:54:49] [INFO ] Deduced a trap composed of 18 places in 592 ms of which 1 ms to minimize.
[2023-03-19 00:54:49] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 1 ms to minimize.
[2023-03-19 00:54:50] [INFO ] Deduced a trap composed of 18 places in 441 ms of which 1 ms to minimize.
[2023-03-19 00:54:50] [INFO ] Deduced a trap composed of 21 places in 488 ms of which 1 ms to minimize.
[2023-03-19 00:54:51] [INFO ] Deduced a trap composed of 19 places in 540 ms of which 2 ms to minimize.
[2023-03-19 00:54:51] [INFO ] Deduced a trap composed of 26 places in 514 ms of which 1 ms to minimize.
[2023-03-19 00:54:51] [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)
[2023-03-19 00:54:52] [INFO ] [Real]Absence check using 271 positive place invariants in 147 ms returned sat
[2023-03-19 00:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:53] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2023-03-19 00:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:54:54] [INFO ] [Nat]Absence check using 271 positive place invariants in 136 ms returned sat
[2023-03-19 00:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:54:54] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2023-03-19 00:54:55] [INFO ] Deduced a trap composed of 26 places in 565 ms of which 1 ms to minimize.
[2023-03-19 00:54:56] [INFO ] Deduced a trap composed of 27 places in 573 ms of which 2 ms to minimize.
[2023-03-19 00:54:56] [INFO ] Deduced a trap composed of 21 places in 613 ms of which 1 ms to minimize.
[2023-03-19 00:54:57] [INFO ] Deduced a trap composed of 34 places in 564 ms of which 1 ms to minimize.
[2023-03-19 00:54:58] [INFO ] Deduced a trap composed of 19 places in 647 ms of which 9 ms to minimize.
[2023-03-19 00:54:59] [INFO ] Deduced a trap composed of 37 places in 569 ms of which 1 ms to minimize.
[2023-03-19 00:54:59] [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 6
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-19 00:54:59] [INFO ] [Real]Absence check using 271 positive place invariants in 104 ms returned sat
[2023-03-19 00:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:00] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2023-03-19 00:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:55:01] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2023-03-19 00:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:02] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2023-03-19 00:55:02] [INFO ] Deduced a trap composed of 32 places in 694 ms of which 2 ms to minimize.
[2023-03-19 00:55:03] [INFO ] Deduced a trap composed of 22 places in 746 ms of which 2 ms to minimize.
[2023-03-19 00:55:04] [INFO ] Deduced a trap composed of 37 places in 787 ms of which 2 ms to minimize.
[2023-03-19 00:55:05] [INFO ] Deduced a trap composed of 23 places in 692 ms of which 1 ms to minimize.
[2023-03-19 00:55:06] [INFO ] Deduced a trap composed of 28 places in 656 ms of which 1 ms to minimize.
[2023-03-19 00:55:06] [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 7
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, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 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 208 places :
Symmetric choice reduction at 4 with 208 rule applications. Total rules 1471 place count 1264 transition count 1113
Iterating global reduction 4 with 208 rules applied. Total rules applied 1679 place count 1264 transition count 1113
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 1679 place count 1264 transition count 1024
Deduced a syphon composed of 89 places in 10 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1857 place count 1175 transition count 1024
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 4 with 1018 rules applied. Total rules applied 2875 place count 666 transition count 515
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 3047 place count 580 transition count 570
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3048 place count 580 transition count 569
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3049 place count 580 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3050 place count 579 transition count 568
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 3079 place count 579 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3080 place count 578 transition count 567
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3082 place count 576 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3082 place count 576 transition count 566
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3084 place count 575 transition count 566
Applied a total of 3084 rules in 648 ms. Remains 575 /2103 variables (removed 1528) and now considering 566/1953 (removed 1387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 575/2103 places, 566/1953 transitions.
// Phase 1: matrix 566 rows 575 cols
[2023-03-19 00:55:06] [INFO ] Computed 269 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5752 ms. (steps per millisecond=173 ) properties (out of 8) seen :6
FORMULA ShieldIIPt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-06 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 3587 ms. (steps per millisecond=278 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3770 ms. (steps per millisecond=265 ) properties (out of 2) seen :1
FORMULA ShieldIIPt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-19 00:55:19] [INFO ] Invariant cache hit.
[2023-03-19 00:55:20] [INFO ] [Real]Absence check using 269 positive place invariants in 70 ms returned sat
[2023-03-19 00:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:20] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-19 00:55:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:55:20] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2023-03-19 00:55:20] [INFO ] Computed and/alt/rep : 563/1002/563 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-19 00:55:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:55:20] [INFO ] [Nat]Absence check using 269 positive place invariants in 58 ms returned sat
[2023-03-19 00:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:20] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2023-03-19 00:55:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-19 00:55:20] [INFO ] Computed and/alt/rep : 563/1002/563 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-19 00:55:28] [INFO ] Added : 511 causal constraints over 103 iterations in 7141 ms. Result :sat
Minimization took 603 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 566/566 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 575 transition count 563
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 572 transition count 563
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 569 transition count 560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 567 transition count 563
Applied a total of 16 rules in 47 ms. Remains 567 /575 variables (removed 8) and now considering 563/566 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 567/575 places, 563/566 transitions.
// Phase 1: matrix 563 rows 567 cols
[2023-03-19 00:55:29] [INFO ] Computed 269 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5374 ms. (steps per millisecond=186 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3439 ms. (steps per millisecond=290 ) properties (out of 1) seen :0
[2023-03-19 00:55:38] [INFO ] Invariant cache hit.
[2023-03-19 00:55:38] [INFO ] [Real]Absence check using 269 positive place invariants in 37 ms returned sat
[2023-03-19 00:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:38] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-19 00:55:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:55:38] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-19 00:55:38] [INFO ] Computed and/alt/rep : 560/998/560 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-19 00:55:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:55:38] [INFO ] [Nat]Absence check using 269 positive place invariants in 52 ms returned sat
[2023-03-19 00:55:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:38] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-19 00:55:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-19 00:55:39] [INFO ] Computed and/alt/rep : 560/998/560 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-19 00:55:46] [INFO ] Added : 503 causal constraints over 102 iterations in 7057 ms. Result :sat
Minimization took 586 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 563/563 transitions.
Applied a total of 0 rules in 16 ms. Remains 567 /567 variables (removed 0) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 567/567 places, 563/563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 563/563 transitions.
Applied a total of 0 rules in 36 ms. Remains 567 /567 variables (removed 0) and now considering 563/563 (removed 0) transitions.
[2023-03-19 00:55:47] [INFO ] Invariant cache hit.
[2023-03-19 00:55:47] [INFO ] Implicit Places using invariants in 453 ms returned [556]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 456 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 566/567 places, 563/563 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 565 transition count 562
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 565 transition count 562
Applied a total of 2 rules in 18 ms. Remains 565 /566 variables (removed 1) and now considering 562/563 (removed 1) transitions.
// Phase 1: matrix 562 rows 565 cols
[2023-03-19 00:55:47] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:55:48] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-19 00:55:48] [INFO ] Invariant cache hit.
[2023-03-19 00:55:48] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 565/567 places, 562/563 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1976 ms. Remains : 565/567 places, 562/563 transitions.
[2023-03-19 00:55:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5615 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3458 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
[2023-03-19 00:55:58] [INFO ] Invariant cache hit.
[2023-03-19 00:55:58] [INFO ] [Real]Absence check using 268 positive place invariants in 62 ms returned sat
[2023-03-19 00:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:58] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-19 00:55:58] [INFO ] Computed and/alt/rep : 559/992/559 causal constraints (skipped 0 transitions) in 43 ms.
[2023-03-19 00:55:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:55:58] [INFO ] [Nat]Absence check using 268 positive place invariants in 47 ms returned sat
[2023-03-19 00:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:59] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-19 00:55:59] [INFO ] Computed and/alt/rep : 559/992/559 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-19 00:56:06] [INFO ] Added : 513 causal constraints over 103 iterations in 7067 ms. Result :sat
Minimization took 650 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 565 /565 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 565/565 places, 562/562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 565 /565 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-19 00:56:07] [INFO ] Invariant cache hit.
[2023-03-19 00:56:07] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-19 00:56:07] [INFO ] Invariant cache hit.
[2023-03-19 00:56:08] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
[2023-03-19 00:56:08] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 00:56:08] [INFO ] Invariant cache hit.
[2023-03-19 00:56:08] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1407 ms. Remains : 565/565 places, 562/562 transitions.
Starting property specific reduction for ShieldIIPt-PT-030B-UpperBounds-15
[2023-03-19 00:56:08] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
[2023-03-19 00:56:08] [INFO ] Invariant cache hit.
[2023-03-19 00:56:08] [INFO ] [Real]Absence check using 268 positive place invariants in 41 ms returned sat
[2023-03-19 00:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:56:09] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-19 00:56:09] [INFO ] Computed and/alt/rep : 559/992/559 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-19 00:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:56:09] [INFO ] [Nat]Absence check using 268 positive place invariants in 68 ms returned sat
[2023-03-19 00:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:56:09] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-19 00:56:09] [INFO ] Computed and/alt/rep : 559/992/559 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-19 00:56:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
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] Max seen :[0]
Support contains 1 out of 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 562/562 transitions.
Applied a total of 0 rules in 22 ms. Remains 565 /565 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 565/565 places, 562/562 transitions.
[2023-03-19 00:56:14] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5456 ms. (steps per millisecond=183 ) properties (out of 1) seen :1
FORMULA ShieldIIPt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for ShieldIIPt-PT-030B-UpperBounds-15 in 11248 ms.
[2023-03-19 00:56:20] [INFO ] Flatten gal took : 95 ms
Total runtime 130677 ms.

BK_STOP 1679187380570

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="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-5348"
echo " Executing tool itstools"
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 r389-oct2-167903713400301"
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 ;