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-167903713400317.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-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 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 686K 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-040B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679188571742

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-040B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 01:16:14] [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 01:16:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:16:15] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-19 01:16:15] [INFO ] Transformed 2803 places.
[2023-03-19 01:16:15] [INFO ] Transformed 2603 transitions.
[2023-03-19 01:16:15] [INFO ] Found NUPN structural information;
[2023-03-19 01:16:15] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-19 01:16:15] [INFO ] Computed 361 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-040B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-00 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) 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 10) seen :0
[2023-03-19 01:16:15] [INFO ] Invariant cache hit.
[2023-03-19 01:16:17] [INFO ] [Real]Absence check using 361 positive place invariants in 621 ms returned sat
[2023-03-19 01:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:19] [INFO ] [Real]Absence check using state equation in 2616 ms returned sat
[2023-03-19 01:16:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:16:20] [INFO ] [Nat]Absence check using 361 positive place invariants in 250 ms returned sat
[2023-03-19 01:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:22] [INFO ] [Nat]Absence check using state equation in 2080 ms returned sat
[2023-03-19 01:16:24] [INFO ] Deduced a trap composed of 28 places in 1251 ms of which 6 ms to minimize.
[2023-03-19 01:16:25] [INFO ] Deduced a trap composed of 25 places in 1006 ms of which 2 ms to minimize.
[2023-03-19 01:16: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 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 01:16:26] [INFO ] [Real]Absence check using 361 positive place invariants in 237 ms returned sat
[2023-03-19 01:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:28] [INFO ] [Real]Absence check using state equation in 1938 ms returned sat
[2023-03-19 01:16:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:16:29] [INFO ] [Nat]Absence check using 361 positive place invariants in 134 ms returned sat
[2023-03-19 01:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:31] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2023-03-19 01:16:32] [INFO ] Deduced a trap composed of 23 places in 1202 ms of which 3 ms to minimize.
[2023-03-19 01:16:33] [INFO ] Deduced a trap composed of 19 places in 1002 ms of which 2 ms to minimize.
[2023-03-19 01:16:33] [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 01:16:34] [INFO ] [Real]Absence check using 361 positive place invariants in 173 ms returned sat
[2023-03-19 01:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:36] [INFO ] [Real]Absence check using state equation in 1873 ms returned sat
[2023-03-19 01:16:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:16:36] [INFO ] [Nat]Absence check using 361 positive place invariants in 224 ms returned sat
[2023-03-19 01:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:39] [INFO ] [Nat]Absence check using state equation in 2129 ms returned sat
[2023-03-19 01:16:40] [INFO ] Deduced a trap composed of 22 places in 988 ms of which 26 ms to minimize.
[2023-03-19 01:16:41] [INFO ] Deduced a trap composed of 23 places in 979 ms of which 2 ms to minimize.
[2023-03-19 01:16:42] [INFO ] Deduced a trap composed of 23 places in 762 ms of which 2 ms to minimize.
[2023-03-19 01:16: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 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 01:16:42] [INFO ] [Real]Absence check using 361 positive place invariants in 244 ms returned sat
[2023-03-19 01:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:44] [INFO ] [Real]Absence check using state equation in 1923 ms returned sat
[2023-03-19 01:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:16:45] [INFO ] [Nat]Absence check using 361 positive place invariants in 333 ms returned sat
[2023-03-19 01:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:47] [INFO ] [Nat]Absence check using state equation in 1681 ms returned sat
[2023-03-19 01:16:48] [INFO ] Deduced a trap composed of 27 places in 877 ms of which 1 ms to minimize.
[2023-03-19 01:16:49] [INFO ] Deduced a trap composed of 30 places in 958 ms of which 2 ms to minimize.
[2023-03-19 01:16:51] [INFO ] Deduced a trap composed of 22 places in 1794 ms of which 1 ms to minimize.
[2023-03-19 01:16: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 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 01:16:52] [INFO ] [Real]Absence check using 361 positive place invariants in 135 ms returned sat
[2023-03-19 01:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:53] [INFO ] [Real]Absence check using state equation in 1456 ms returned sat
[2023-03-19 01:16:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:16:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 168 ms returned sat
[2023-03-19 01:16:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:16:56] [INFO ] [Nat]Absence check using state equation in 2002 ms returned sat
[2023-03-19 01:16:58] [INFO ] Deduced a trap composed of 26 places in 1365 ms of which 14 ms to minimize.
[2023-03-19 01:16:58] [INFO ] Deduced a trap composed of 19 places in 698 ms of which 1 ms to minimize.
[2023-03-19 01:16:58] [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 01:16:59] [INFO ] [Real]Absence check using 361 positive place invariants in 201 ms returned sat
[2023-03-19 01:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:01] [INFO ] [Real]Absence check using state equation in 2071 ms returned sat
[2023-03-19 01:17:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:17:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 420 ms returned sat
[2023-03-19 01:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:04] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2023-03-19 01:17:05] [INFO ] Deduced a trap composed of 18 places in 864 ms of which 2 ms to minimize.
[2023-03-19 01:17:06] [INFO ] Deduced a trap composed of 25 places in 985 ms of which 2 ms to minimize.
[2023-03-19 01:17:07] [INFO ] Deduced a trap composed of 25 places in 794 ms of which 1 ms to minimize.
[2023-03-19 01:17:07] [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 01:17:08] [INFO ] [Real]Absence check using 361 positive place invariants in 237 ms returned sat
[2023-03-19 01:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:09] [INFO ] [Real]Absence check using state equation in 1384 ms returned sat
[2023-03-19 01:17:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:17:10] [INFO ] [Nat]Absence check using 361 positive place invariants in 244 ms returned sat
[2023-03-19 01:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:12] [INFO ] [Nat]Absence check using state equation in 1691 ms returned sat
[2023-03-19 01:17:14] [INFO ] Deduced a trap composed of 17 places in 1645 ms of which 3 ms to minimize.
[2023-03-19 01:17:15] [INFO ] Deduced a trap composed of 15 places in 794 ms of which 2 ms to minimize.
[2023-03-19 01:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2656 ms
[2023-03-19 01:17:16] [INFO ] [Real]Absence check using 361 positive place invariants in 193 ms returned sat
[2023-03-19 01:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:17] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2023-03-19 01:17:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:17:18] [INFO ] [Nat]Absence check using 361 positive place invariants in 200 ms returned sat
[2023-03-19 01:17:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:19] [INFO ] [Nat]Absence check using state equation in 1315 ms returned sat
[2023-03-19 01:17:20] [INFO ] Deduced a trap composed of 24 places in 1175 ms of which 2 ms to minimize.
[2023-03-19 01:17:21] [INFO ] Deduced a trap composed of 28 places in 816 ms of which 2 ms to minimize.
[2023-03-19 01:17:22] [INFO ] Deduced a trap composed of 34 places in 931 ms of which 1 ms to minimize.
[2023-03-19 01:17:22] [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)
[2023-03-19 01:17:23] [INFO ] [Real]Absence check using 361 positive place invariants in 223 ms returned sat
[2023-03-19 01:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:26] [INFO ] [Real]Absence check using state equation in 2987 ms returned sat
[2023-03-19 01:17:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:17:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 174 ms returned sat
[2023-03-19 01:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:29] [INFO ] [Nat]Absence check using state equation in 1694 ms returned sat
[2023-03-19 01:17:30] [INFO ] Deduced a trap composed of 23 places in 1048 ms of which 2 ms to minimize.
[2023-03-19 01:17:31] [INFO ] Deduced a trap composed of 23 places in 1008 ms of which 2 ms to minimize.
[2023-03-19 01:17:32] [INFO ] Deduced a trap composed of 28 places in 1066 ms of which 2 ms to minimize.
[2023-03-19 01:17: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 8
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 01:17:33] [INFO ] [Real]Absence check using 361 positive place invariants in 222 ms returned sat
[2023-03-19 01:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:34] [INFO ] [Real]Absence check using state equation in 1410 ms returned sat
[2023-03-19 01:17:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:17:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 155 ms returned sat
[2023-03-19 01:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:17:37] [INFO ] [Nat]Absence check using state equation in 1498 ms returned sat
[2023-03-19 01:17:38] [INFO ] Deduced a trap composed of 22 places in 924 ms of which 3 ms to minimize.
[2023-03-19 01:17:39] [INFO ] Deduced a trap composed of 25 places in 1147 ms of which 2 ms to minimize.
[2023-03-19 01:17:40] [INFO ] Deduced a trap composed of 24 places in 876 ms of which 2 ms to minimize.
[2023-03-19 01:17:40] [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 9
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, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 675 transitions
Trivial Post-agglo rules discarded 675 transitions
Performed 675 trivial Post agglomeration. Transition count delta: 675
Iterating post reduction 0 with 675 rules applied. Total rules applied 675 place count 2803 transition count 1928
Reduce places removed 675 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 677 rules applied. Total rules applied 1352 place count 2128 transition count 1926
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 1355 place count 2127 transition count 1924
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1357 place count 2125 transition count 1924
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 160 Pre rules applied. Total rules applied 1357 place count 2125 transition count 1764
Deduced a syphon composed of 160 places in 3 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 4 with 320 rules applied. Total rules applied 1677 place count 1965 transition count 1764
Discarding 278 places :
Symmetric choice reduction at 4 with 278 rule applications. Total rules 1955 place count 1687 transition count 1486
Iterating global reduction 4 with 278 rules applied. Total rules applied 2233 place count 1687 transition count 1486
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 118 Pre rules applied. Total rules applied 2233 place count 1687 transition count 1368
Deduced a syphon composed of 118 places in 6 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 2469 place count 1569 transition count 1368
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 2 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 4 with 1358 rules applied. Total rules applied 3827 place count 890 transition count 689
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4029 place count 789 transition count 754
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 4057 place count 775 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4058 place count 775 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4059 place count 775 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4060 place count 774 transition count 761
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 4099 place count 774 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4100 place count 773 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4102 place count 771 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4102 place count 771 transition count 759
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 4104 place count 770 transition count 759
Applied a total of 4104 rules in 806 ms. Remains 770 /2803 variables (removed 2033) and now considering 759/2603 (removed 1844) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 770/2803 places, 759/2603 transitions.
// Phase 1: matrix 759 rows 770 cols
[2023-03-19 01:17:42] [INFO ] Computed 359 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6984 ms. (steps per millisecond=143 ) properties (out of 10) seen :3
FORMULA ShieldIIPt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4588 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4501 ms. (steps per millisecond=222 ) properties (out of 7) seen :3
FORMULA ShieldIIPt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4596 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4719 ms. (steps per millisecond=211 ) properties (out of 4) seen :0
[2023-03-19 01:18:07] [INFO ] Invariant cache hit.
[2023-03-19 01:18:08] [INFO ] [Real]Absence check using 359 positive place invariants in 125 ms returned sat
[2023-03-19 01:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:08] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-19 01:18:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:18:08] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-19 01:18:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:18:08] [INFO ] [Nat]Absence check using 359 positive place invariants in 55 ms returned sat
[2023-03-19 01:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:09] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2023-03-19 01:18:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2023-03-19 01:18:09] [INFO ] Computed and/alt/rep : 756/1337/756 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-19 01:18:21] [INFO ] Added : 698 causal constraints over 140 iterations in 12360 ms. Result :sat
Minimization took 574 ms.
[2023-03-19 01:18:22] [INFO ] [Real]Absence check using 359 positive place invariants in 119 ms returned sat
[2023-03-19 01:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:23] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2023-03-19 01:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:18:23] [INFO ] [Nat]Absence check using 359 positive place invariants in 137 ms returned sat
[2023-03-19 01:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:23] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2023-03-19 01:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2023-03-19 01:18:24] [INFO ] Computed and/alt/rep : 756/1337/756 causal constraints (skipped 0 transitions) in 82 ms.
[2023-03-19 01:18:35] [INFO ] Added : 681 causal constraints over 137 iterations in 11773 ms. Result :sat
Minimization took 1290 ms.
[2023-03-19 01:18:37] [INFO ] [Real]Absence check using 359 positive place invariants in 92 ms returned sat
[2023-03-19 01:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:37] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2023-03-19 01:18:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:18:37] [INFO ] [Nat]Absence check using 359 positive place invariants in 135 ms returned sat
[2023-03-19 01:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:38] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-19 01:18:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-19 01:18:38] [INFO ] Computed and/alt/rep : 756/1337/756 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-19 01:18:49] [INFO ] Added : 694 causal constraints over 140 iterations in 11684 ms. Result :sat
Minimization took 1636 ms.
[2023-03-19 01:18:51] [INFO ] [Real]Absence check using 359 positive place invariants in 102 ms returned sat
[2023-03-19 01:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:52] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-19 01:18:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:18:52] [INFO ] [Nat]Absence check using 359 positive place invariants in 50 ms returned sat
[2023-03-19 01:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:18:52] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-19 01:18:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-19 01:18:52] [INFO ] Computed and/alt/rep : 756/1337/756 causal constraints (skipped 0 transitions) in 72 ms.
[2023-03-19 01:19:04] [INFO ] Added : 689 causal constraints over 139 iterations in 11786 ms. Result :sat
Minimization took 1918 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ShieldIIPt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 175458 ms.

BK_STOP 1679188754323

--------------------
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-040B"
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-040B, 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-167903713400317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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