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.r391-oct2-167903715100317.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 lolaxred
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 r391-oct2-167903715100317
=====================================================================

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

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:48:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 00:48:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:48:37] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-20 00:48:37] [INFO ] Transformed 2803 places.
[2023-03-20 00:48:37] [INFO ] Transformed 2603 transitions.
[2023-03-20 00:48:37] [INFO ] Found NUPN structural information;
[2023-03-20 00:48:37] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-20 00:48:37] [INFO ] Computed 361 place invariants in 72 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 16) seen :5
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-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :0
[2023-03-20 00:48:38] [INFO ] Invariant cache hit.
[2023-03-20 00:48:39] [INFO ] [Real]Absence check using 361 positive place invariants in 433 ms returned sat
[2023-03-20 00:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:48:41] [INFO ] [Real]Absence check using state equation in 1523 ms returned sat
[2023-03-20 00:48:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:48:42] [INFO ] [Nat]Absence check using 361 positive place invariants in 154 ms returned sat
[2023-03-20 00:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:48:44] [INFO ] [Nat]Absence check using state equation in 1741 ms returned sat
[2023-03-20 00:48:45] [INFO ] Deduced a trap composed of 28 places in 923 ms of which 5 ms to minimize.
[2023-03-20 00:48:46] [INFO ] Deduced a trap composed of 25 places in 1174 ms of which 5 ms to minimize.
[2023-03-20 00:48:47] [INFO ] Deduced a trap composed of 18 places in 1114 ms of which 3 ms to minimize.
[2023-03-20 00:48:47] [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-20 00:48:48] [INFO ] [Real]Absence check using 361 positive place invariants in 152 ms returned sat
[2023-03-20 00:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:48:49] [INFO ] [Real]Absence check using state equation in 1442 ms returned sat
[2023-03-20 00:48:51] [INFO ] Deduced a trap composed of 26 places in 1051 ms of which 27 ms to minimize.
[2023-03-20 00:48:52] [INFO ] Deduced a trap composed of 24 places in 975 ms of which 10 ms to minimize.
[2023-03-20 00:48:53] [INFO ] Deduced a trap composed of 26 places in 934 ms of which 2 ms to minimize.
[2023-03-20 00:48:53] [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:2618)
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-20 00:48:53] [INFO ] [Real]Absence check using 361 positive place invariants in 167 ms returned sat
[2023-03-20 00:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:48:55] [INFO ] [Real]Absence check using state equation in 1429 ms returned sat
[2023-03-20 00:48:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:48:56] [INFO ] [Nat]Absence check using 361 positive place invariants in 154 ms returned sat
[2023-03-20 00:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:48:57] [INFO ] [Nat]Absence check using state equation in 1351 ms returned sat
[2023-03-20 00:48:58] [INFO ] Deduced a trap composed of 23 places in 810 ms of which 2 ms to minimize.
[2023-03-20 00:48:59] [INFO ] Deduced a trap composed of 19 places in 807 ms of which 2 ms to minimize.
[2023-03-20 00:49:00] [INFO ] Deduced a trap composed of 17 places in 897 ms of which 4 ms to minimize.
[2023-03-20 00:49:01] [INFO ] Deduced a trap composed of 18 places in 890 ms of which 2 ms to minimize.
[2023-03-20 00:49:01] [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-20 00:49:02] [INFO ] [Real]Absence check using 361 positive place invariants in 177 ms returned sat
[2023-03-20 00:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:03] [INFO ] [Real]Absence check using state equation in 1468 ms returned sat
[2023-03-20 00:49:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:04] [INFO ] [Nat]Absence check using 361 positive place invariants in 340 ms returned sat
[2023-03-20 00:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:06] [INFO ] [Nat]Absence check using state equation in 1444 ms returned sat
[2023-03-20 00:49:07] [INFO ] Deduced a trap composed of 22 places in 897 ms of which 2 ms to minimize.
[2023-03-20 00:49:08] [INFO ] Deduced a trap composed of 23 places in 828 ms of which 14 ms to minimize.
[2023-03-20 00:49:08] [INFO ] Deduced a trap composed of 23 places in 733 ms of which 2 ms to minimize.
[2023-03-20 00:49:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-20 00:49:09] [INFO ] [Real]Absence check using 361 positive place invariants in 169 ms returned sat
[2023-03-20 00:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:10] [INFO ] [Real]Absence check using state equation in 1283 ms returned sat
[2023-03-20 00:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:11] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2023-03-20 00:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:13] [INFO ] [Nat]Absence check using state equation in 1781 ms returned sat
[2023-03-20 00:49:14] [INFO ] Deduced a trap composed of 27 places in 1125 ms of which 2 ms to minimize.
[2023-03-20 00:49:15] [INFO ] Deduced a trap composed of 30 places in 1150 ms of which 14 ms to minimize.
[2023-03-20 00:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2607 ms
[2023-03-20 00:49:16] [INFO ] [Real]Absence check using 361 positive place invariants in 429 ms returned sat
[2023-03-20 00:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:18] [INFO ] [Real]Absence check using state equation in 1360 ms returned sat
[2023-03-20 00:49:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:19] [INFO ] [Nat]Absence check using 361 positive place invariants in 159 ms returned sat
[2023-03-20 00:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:20] [INFO ] [Nat]Absence check using state equation in 1685 ms returned sat
[2023-03-20 00:49:21] [INFO ] Deduced a trap composed of 26 places in 566 ms of which 1 ms to minimize.
[2023-03-20 00:49:22] [INFO ] Deduced a trap composed of 19 places in 635 ms of which 2 ms to minimize.
[2023-03-20 00:49:23] [INFO ] Deduced a trap composed of 22 places in 652 ms of which 1 ms to minimize.
[2023-03-20 00:49:23] [INFO ] Deduced a trap composed of 23 places in 669 ms of which 2 ms to minimize.
[2023-03-20 00:49:23] [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-20 00:49:24] [INFO ] [Real]Absence check using 361 positive place invariants in 149 ms returned sat
[2023-03-20 00:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:25] [INFO ] [Real]Absence check using state equation in 1414 ms returned sat
[2023-03-20 00:49:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:26] [INFO ] [Nat]Absence check using 361 positive place invariants in 151 ms returned sat
[2023-03-20 00:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:27] [INFO ] [Nat]Absence check using state equation in 1250 ms returned sat
[2023-03-20 00:49:28] [INFO ] Deduced a trap composed of 18 places in 994 ms of which 2 ms to minimize.
[2023-03-20 00:49:29] [INFO ] Deduced a trap composed of 25 places in 891 ms of which 14 ms to minimize.
[2023-03-20 00:49:30] [INFO ] Deduced a trap composed of 25 places in 898 ms of which 14 ms to minimize.
[2023-03-20 00:49:32] [INFO ] Deduced a trap composed of 17 places in 1643 ms of which 2 ms to minimize.
[2023-03-20 00:49: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 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-20 00:49:33] [INFO ] [Real]Absence check using 361 positive place invariants in 151 ms returned sat
[2023-03-20 00:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:34] [INFO ] [Real]Absence check using state equation in 1312 ms returned sat
[2023-03-20 00:49:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 153 ms returned sat
[2023-03-20 00:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:36] [INFO ] [Nat]Absence check using state equation in 1297 ms returned sat
[2023-03-20 00:49:37] [INFO ] Deduced a trap composed of 17 places in 935 ms of which 2 ms to minimize.
[2023-03-20 00:49:38] [INFO ] Deduced a trap composed of 15 places in 827 ms of which 2 ms to minimize.
[2023-03-20 00:49:39] [INFO ] Deduced a trap composed of 22 places in 866 ms of which 2 ms to minimize.
[2023-03-20 00:49:40] [INFO ] Deduced a trap composed of 24 places in 849 ms of which 1 ms to minimize.
[2023-03-20 00:49: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 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-20 00:49:40] [INFO ] [Real]Absence check using 361 positive place invariants in 151 ms returned sat
[2023-03-20 00:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:42] [INFO ] [Real]Absence check using state equation in 1362 ms returned sat
[2023-03-20 00:49:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 165 ms returned sat
[2023-03-20 00:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:44] [INFO ] [Nat]Absence check using state equation in 1385 ms returned sat
[2023-03-20 00:49:45] [INFO ] Deduced a trap composed of 24 places in 768 ms of which 1 ms to minimize.
[2023-03-20 00:49:46] [INFO ] Deduced a trap composed of 28 places in 888 ms of which 1 ms to minimize.
[2023-03-20 00:49:47] [INFO ] Deduced a trap composed of 34 places in 923 ms of which 2 ms to minimize.
[2023-03-20 00:49:48] [INFO ] Deduced a trap composed of 18 places in 792 ms of which 2 ms to minimize.
[2023-03-20 00:49:48] [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-20 00:49:48] [INFO ] [Real]Absence check using 361 positive place invariants in 223 ms returned sat
[2023-03-20 00:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:50] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2023-03-20 00:49:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:50] [INFO ] [Nat]Absence check using 361 positive place invariants in 167 ms returned sat
[2023-03-20 00:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:52] [INFO ] [Nat]Absence check using state equation in 1179 ms returned sat
[2023-03-20 00:49:53] [INFO ] Deduced a trap composed of 23 places in 1309 ms of which 1 ms to minimize.
[2023-03-20 00:49:54] [INFO ] Deduced a trap composed of 23 places in 756 ms of which 2 ms to minimize.
[2023-03-20 00:49:55] [INFO ] Deduced a trap composed of 28 places in 832 ms of which 13 ms to minimize.
[2023-03-20 00:49:56] [INFO ] Deduced a trap composed of 15 places in 729 ms of which 3 ms to minimize.
[2023-03-20 00:49:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
[2023-03-20 00:49:56] [INFO ] [Real]Absence check using 361 positive place invariants in 196 ms returned sat
[2023-03-20 00:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:49:58] [INFO ] [Real]Absence check using state equation in 1682 ms returned sat
[2023-03-20 00:49:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:49:59] [INFO ] [Nat]Absence check using 361 positive place invariants in 183 ms returned sat
[2023-03-20 00:49:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:50:00] [INFO ] [Nat]Absence check using state equation in 1600 ms returned sat
[2023-03-20 00:50:01] [INFO ] Deduced a trap composed of 22 places in 826 ms of which 1 ms to minimize.
[2023-03-20 00:50:02] [INFO ] Deduced a trap composed of 25 places in 920 ms of which 2 ms to minimize.
[2023-03-20 00:50:03] [INFO ] Deduced a trap composed of 24 places in 927 ms of which 3 ms to minimize.
[2023-03-20 00:50:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 674 transitions
Trivial Post-agglo rules discarded 674 transitions
Performed 674 trivial Post agglomeration. Transition count delta: 674
Iterating post reduction 0 with 674 rules applied. Total rules applied 674 place count 2803 transition count 1929
Reduce places removed 674 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 676 rules applied. Total rules applied 1350 place count 2129 transition count 1927
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 1354 place count 2128 transition count 1924
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 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 4 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 7 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 2 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 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 4098 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 4099 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 4101 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 4101 place count 771 transition count 759
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4103 place count 770 transition count 759
Applied a total of 4103 rules in 850 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 850 ms. Remains : 770/2803 places, 759/2603 transitions.
// Phase 1: matrix 759 rows 770 cols
[2023-03-20 00:50:05] [INFO ] Computed 359 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6912 ms. (steps per millisecond=144 ) properties (out of 11) seen :5
FORMULA ShieldIIPt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-02 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 4428 ms. (steps per millisecond=225 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4369 ms. (steps per millisecond=228 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4499 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4484 ms. (steps per millisecond=223 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4482 ms. (steps per millisecond=223 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4383 ms. (steps per millisecond=228 ) properties (out of 6) seen :0
[2023-03-20 00:50:39] [INFO ] Invariant cache hit.
[2023-03-20 00:50:39] [INFO ] [Real]Absence check using 359 positive place invariants in 102 ms returned sat
[2023-03-20 00:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:50:39] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-20 00:50:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:50:39] [INFO ] [Real]Added 1 Read/Feed constraints in 26 ms returned sat
[2023-03-20 00:50:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:50:39] [INFO ] [Nat]Absence check using 359 positive place invariants in 50 ms returned sat
[2023-03-20 00:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:50:40] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-20 00:50:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2023-03-20 00:50:40] [INFO ] Computed and/alt/rep : 756/1332/756 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-20 00:50:51] [INFO ] Added : 683 causal constraints over 137 iterations in 10892 ms. Result :sat
Minimization took 1193 ms.
[2023-03-20 00:50:52] [INFO ] [Real]Absence check using 359 positive place invariants in 48 ms returned sat
[2023-03-20 00:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:50:52] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-20 00:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:50:53] [INFO ] [Nat]Absence check using 359 positive place invariants in 106 ms returned sat
[2023-03-20 00:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:50:53] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-20 00:50:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2023-03-20 00:50:53] [INFO ] Computed and/alt/rep : 756/1332/756 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-20 00:51:05] [INFO ] Added : 685 causal constraints over 138 iterations in 12127 ms. Result :sat
Minimization took 1066 ms.
[2023-03-20 00:51:07] [INFO ] [Real]Absence check using 359 positive place invariants in 68 ms returned sat
[2023-03-20 00:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:07] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-20 00:51:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:51:07] [INFO ] [Nat]Absence check using 359 positive place invariants in 58 ms returned sat
[2023-03-20 00:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:07] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-20 00:51:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-20 00:51:07] [INFO ] Computed and/alt/rep : 756/1332/756 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-20 00:51:19] [INFO ] Added : 683 causal constraints over 137 iterations in 11981 ms. Result :sat
Minimization took 1843 ms.
[2023-03-20 00:51:21] [INFO ] [Real]Absence check using 359 positive place invariants in 116 ms returned sat
[2023-03-20 00:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:22] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-20 00:51:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:51:22] [INFO ] [Nat]Absence check using 359 positive place invariants in 89 ms returned sat
[2023-03-20 00:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:22] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-20 00:51:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-20 00:51:22] [INFO ] Computed and/alt/rep : 756/1332/756 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-20 00:51:35] [INFO ] Added : 702 causal constraints over 141 iterations in 12676 ms. Result :sat
Minimization took 1347 ms.
[2023-03-20 00:51:37] [INFO ] [Real]Absence check using 359 positive place invariants in 53 ms returned sat
[2023-03-20 00:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:37] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2023-03-20 00:51:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:51:37] [INFO ] [Nat]Absence check using 359 positive place invariants in 78 ms returned sat
[2023-03-20 00:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:37] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-20 00:51:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2023-03-20 00:51:37] [INFO ] Computed and/alt/rep : 756/1332/756 causal constraints (skipped 0 transitions) in 66 ms.
[2023-03-20 00:51:49] [INFO ] Added : 678 causal constraints over 136 iterations in 11962 ms. Result :sat
Minimization took 2558 ms.
[2023-03-20 00:51:52] [INFO ] [Real]Absence check using 359 positive place invariants in 85 ms returned sat
[2023-03-20 00:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:52] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-20 00:51:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-20 00:51:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:51:53] [INFO ] [Nat]Absence check using 359 positive place invariants in 72 ms returned sat
[2023-03-20 00:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:51:53] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-20 00:51:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-20 00:51:53] [INFO ] Computed and/alt/rep : 756/1332/756 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-20 00:52:05] [INFO ] Added : 690 causal constraints over 138 iterations in 11998 ms. Result :sat
Minimization took 856 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 759/759 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 770 transition count 756
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 767 transition count 756
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 767 transition count 754
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 765 transition count 754
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 762 transition count 751
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 761 transition count 752
Applied a total of 18 rules in 83 ms. Remains 761 /770 variables (removed 9) and now considering 752/759 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 761/770 places, 752/759 transitions.
// Phase 1: matrix 752 rows 761 cols
[2023-03-20 00:52:11] [INFO ] Computed 359 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6392 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4414 ms. (steps per millisecond=226 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4441 ms. (steps per millisecond=225 ) properties (out of 2) seen :0
[2023-03-20 00:52:27] [INFO ] Invariant cache hit.
[2023-03-20 00:52:27] [INFO ] [Real]Absence check using 359 positive place invariants in 87 ms returned sat
[2023-03-20 00:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:52:27] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-20 00:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:52:27] [INFO ] [Nat]Absence check using 359 positive place invariants in 44 ms returned sat
[2023-03-20 00:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:52:28] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-20 00:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:52:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2023-03-20 00:52:28] [INFO ] Computed and/alt/rep : 749/1328/749 causal constraints (skipped 0 transitions) in 60 ms.
[2023-03-20 00:52:39] [INFO ] Added : 694 causal constraints over 140 iterations in 10902 ms. Result :sat
Minimization took 2092 ms.
[2023-03-20 00:52:41] [INFO ] [Real]Absence check using 359 positive place invariants in 122 ms returned sat
[2023-03-20 00:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:52:41] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-20 00:52:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:52:42] [INFO ] [Nat]Absence check using 359 positive place invariants in 59 ms returned sat
[2023-03-20 00:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:52:42] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-20 00:52:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-20 00:52:42] [INFO ] Computed and/alt/rep : 749/1328/749 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-20 00:52:53] [INFO ] Added : 676 causal constraints over 137 iterations in 10764 ms. Result :sat
Minimization took 953 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 752/752 transitions.
Applied a total of 0 rules in 17 ms. Remains 761 /761 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 761/761 places, 752/752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 752/752 transitions.
Applied a total of 0 rules in 32 ms. Remains 761 /761 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2023-03-20 00:52:55] [INFO ] Invariant cache hit.
[2023-03-20 00:52:56] [INFO ] Implicit Places using invariants in 529 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 533 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 752/752 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 751
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 751
Applied a total of 2 rules in 41 ms. Remains 759 /760 variables (removed 1) and now considering 751/752 (removed 1) transitions.
// Phase 1: matrix 751 rows 759 cols
[2023-03-20 00:52:56] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:52:56] [INFO ] Implicit Places using invariants in 603 ms returned []
[2023-03-20 00:52:56] [INFO ] Invariant cache hit.
[2023-03-20 00:52:57] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 751/752 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2152 ms. Remains : 759/761 places, 751/752 transitions.
[2023-03-20 00:52:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6314 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4667 ms. (steps per millisecond=214 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4638 ms. (steps per millisecond=215 ) properties (out of 2) seen :0
[2023-03-20 00:53:13] [INFO ] Invariant cache hit.
[2023-03-20 00:53:13] [INFO ] [Real]Absence check using 358 positive place invariants in 233 ms returned sat
[2023-03-20 00:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:14] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-20 00:53:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:53:14] [INFO ] [Nat]Absence check using 358 positive place invariants in 68 ms returned sat
[2023-03-20 00:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:14] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-20 00:53:14] [INFO ] Computed and/alt/rep : 748/1322/748 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-20 00:53:25] [INFO ] Added : 678 causal constraints over 136 iterations in 10858 ms. Result :sat
Minimization took 1515 ms.
[2023-03-20 00:53:27] [INFO ] [Real]Absence check using 358 positive place invariants in 102 ms returned sat
[2023-03-20 00:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:27] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-20 00:53:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:53:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 63 ms returned sat
[2023-03-20 00:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:28] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-03-20 00:53:28] [INFO ] Computed and/alt/rep : 748/1322/748 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-20 00:53:37] [INFO ] Added : 680 causal constraints over 137 iterations in 8848 ms. Result :sat
Minimization took 1539 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 751/751 transitions.
Applied a total of 0 rules in 15 ms. Remains 759 /759 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 759/759 places, 751/751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 751/751 transitions.
Applied a total of 0 rules in 14 ms. Remains 759 /759 variables (removed 0) and now considering 751/751 (removed 0) transitions.
[2023-03-20 00:53:40] [INFO ] Invariant cache hit.
[2023-03-20 00:53:40] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-20 00:53:40] [INFO ] Invariant cache hit.
[2023-03-20 00:53:41] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2023-03-20 00:53:41] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-20 00:53:41] [INFO ] Invariant cache hit.
[2023-03-20 00:53:41] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1847 ms. Remains : 759/759 places, 751/751 transitions.
Starting property specific reduction for ShieldIIPt-PT-040B-UpperBounds-07
[2023-03-20 00:53:41] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
[2023-03-20 00:53:42] [INFO ] Invariant cache hit.
[2023-03-20 00:53:42] [INFO ] [Real]Absence check using 358 positive place invariants in 91 ms returned sat
[2023-03-20 00:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:42] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2023-03-20 00:53:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:53:42] [INFO ] [Nat]Absence check using 358 positive place invariants in 105 ms returned sat
[2023-03-20 00:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:43] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2023-03-20 00:53:43] [INFO ] Computed and/alt/rep : 748/1322/748 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-20 00:53:47] [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 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 751/751 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 750
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 750
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 757 transition count 751
Applied a total of 4 rules in 42 ms. Remains 757 /759 variables (removed 2) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 757/759 places, 751/751 transitions.
// Phase 1: matrix 751 rows 757 cols
[2023-03-20 00:53:47] [INFO ] Computed 358 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6144 ms. (steps per millisecond=162 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4261 ms. (steps per millisecond=234 ) properties (out of 1) seen :0
[2023-03-20 00:53:58] [INFO ] Invariant cache hit.
[2023-03-20 00:53:58] [INFO ] [Real]Absence check using 358 positive place invariants in 79 ms returned sat
[2023-03-20 00:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:58] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-20 00:53:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:53:58] [INFO ] [Nat]Absence check using 358 positive place invariants in 167 ms returned sat
[2023-03-20 00:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:53:59] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-20 00:53:59] [INFO ] Computed and/alt/rep : 748/1325/748 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-20 00:54:07] [INFO ] Added : 694 causal constraints over 140 iterations in 8507 ms. Result :sat
Minimization took 1365 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 751/751 transitions.
Applied a total of 0 rules in 23 ms. Remains 757 /757 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 757/757 places, 751/751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 751/751 transitions.
Applied a total of 0 rules in 13 ms. Remains 757 /757 variables (removed 0) and now considering 751/751 (removed 0) transitions.
[2023-03-20 00:54:09] [INFO ] Invariant cache hit.
[2023-03-20 00:54:10] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-20 00:54:10] [INFO ] Invariant cache hit.
[2023-03-20 00:54:11] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-03-20 00:54:11] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-20 00:54:11] [INFO ] Invariant cache hit.
[2023-03-20 00:54:11] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1805 ms. Remains : 757/757 places, 751/751 transitions.
Ending property specific reduction for ShieldIIPt-PT-040B-UpperBounds-07 in 29884 ms.
Starting property specific reduction for ShieldIIPt-PT-040B-UpperBounds-08
// Phase 1: matrix 751 rows 759 cols
[2023-03-20 00:54:11] [INFO ] Computed 358 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
[2023-03-20 00:54:11] [INFO ] Invariant cache hit.
[2023-03-20 00:54:12] [INFO ] [Real]Absence check using 358 positive place invariants in 115 ms returned sat
[2023-03-20 00:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:54:12] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-20 00:54:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:54:12] [INFO ] [Nat]Absence check using 358 positive place invariants in 181 ms returned sat
[2023-03-20 00:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:54:13] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-20 00:54:13] [INFO ] Computed and/alt/rep : 748/1322/748 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-20 00:54:17] [INFO ] Deduced a trap composed of 2 places in 431 ms of which 1 ms to minimize.
[2023-03-20 00:54:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1177)
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 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 751/751 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 750
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 750
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 757 transition count 751
Applied a total of 4 rules in 49 ms. Remains 757 /759 variables (removed 2) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 757/759 places, 751/751 transitions.
// Phase 1: matrix 751 rows 757 cols
[2023-03-20 00:54:18] [INFO ] Computed 358 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6284 ms. (steps per millisecond=159 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4448 ms. (steps per millisecond=224 ) properties (out of 1) seen :0
[2023-03-20 00:54:28] [INFO ] Invariant cache hit.
[2023-03-20 00:54:28] [INFO ] [Real]Absence check using 358 positive place invariants in 74 ms returned sat
[2023-03-20 00:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:54:29] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-20 00:54:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:54:29] [INFO ] [Nat]Absence check using 358 positive place invariants in 63 ms returned sat
[2023-03-20 00:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:54:29] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-20 00:54:29] [INFO ] Computed and/alt/rep : 748/1325/748 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-20 00:54:38] [INFO ] Added : 673 causal constraints over 135 iterations in 8538 ms. Result :sat
Minimization took 1212 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 751/751 transitions.
Applied a total of 0 rules in 15 ms. Remains 757 /757 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 757/757 places, 751/751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 751/751 transitions.
Applied a total of 0 rules in 15 ms. Remains 757 /757 variables (removed 0) and now considering 751/751 (removed 0) transitions.
[2023-03-20 00:54:40] [INFO ] Invariant cache hit.
[2023-03-20 00:54:40] [INFO ] Implicit Places using invariants in 777 ms returned []
[2023-03-20 00:54:40] [INFO ] Invariant cache hit.
[2023-03-20 00:54:41] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2023-03-20 00:54:41] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-20 00:54:41] [INFO ] Invariant cache hit.
[2023-03-20 00:54:42] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2313 ms. Remains : 757/757 places, 751/751 transitions.
Ending property specific reduction for ShieldIIPt-PT-040B-UpperBounds-08 in 30565 ms.
[2023-03-20 00:54:42] [INFO ] Flatten gal took : 104 ms
[2023-03-20 00:54:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 00:54:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 759 places, 751 transitions and 3709 arcs took 5 ms.
Total runtime 365864 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-040B
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
Upper Bounds

FORMULA ShieldIIPt-PT-040B-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040B-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679273683333

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 8 (type EXCL) for 3 ShieldIIPt-PT-040B-UpperBounds-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 ShieldIIPt-PT-040B-UpperBounds-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 ShieldIIPt-PT-040B-UpperBounds-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: REPORT NUM
lola: FINISHED task # 6 (type FNDP) for ShieldIIPt-PT-040B-UpperBounds-08
lola: fired transitions : 83
lola: tried executions : 1
lola: time used : 0.000000
lola: Structural Bound: 1
lola: REPORT NUM
lola: CANCELED task # 7 (type EQUN) for ShieldIIPt-PT-040B-UpperBounds-08 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ShieldIIPt-PT-040B-UpperBounds-08 (obsolete)
lola: FINISHED task # 8 (type EXCL) for ShieldIIPt-PT-040B-UpperBounds-08
lola: markings : 85
lola: fired transitions : 84
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/377/UpperBounds-7.sara.
lola: LAUNCH task # 11 (type EXCL) for 0 ShieldIIPt-PT-040B-UpperBounds-07
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 ShieldIIPt-PT-040B-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 ShieldIIPt-PT-040B-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: REPORT NUM
lola: FINISHED task # 9 (type FNDP) for ShieldIIPt-PT-040B-UpperBounds-07
lola: fired transitions : 75
lola: tried executions : 1
lola: time used : 0.000000
lola: CANCELED task # 10 (type EQUN) for ShieldIIPt-PT-040B-UpperBounds-07 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldIIPt-PT-040B-UpperBounds-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-UpperBounds-07: BOUND 1 findpath
ShieldIIPt-PT-040B-UpperBounds-08: BOUND 1 findpath


Time elapsed: 1 secs. Pages in use: 1

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="lolaxred"
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 lolaxred"
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 r391-oct2-167903715100317"
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 ;