Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026201053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026201053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.4K Apr 30 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 01:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 01:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653084918700

Running Version 202205111006
[2022-05-20 22:15:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:15:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:15:20] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2022-05-20 22:15:20] [INFO ] Transformed 5003 places.
[2022-05-20 22:15:20] [INFO ] Transformed 5003 transitions.
[2022-05-20 22:15:20] [INFO ] Found NUPN structural information;
[2022-05-20 22:15:20] [INFO ] Parsed PT model containing 5003 places and 5003 transitions in 486 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 5003 rows 5003 cols
[2022-05-20 22:15:20] [INFO ] Computed 401 place invariants in 51 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 16) seen :12
FORMULA ShieldRVt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
// Phase 1: matrix 5003 rows 5003 cols
[2022-05-20 22:15:20] [INFO ] Computed 401 place invariants in 20 ms
[2022-05-20 22:15:22] [INFO ] [Real]Absence check using 401 positive place invariants in 284 ms returned sat
[2022-05-20 22:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:15:25] [INFO ] [Real]Absence check using state equation in 3242 ms returned sat
[2022-05-20 22:15:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:15:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 279 ms returned sat
[2022-05-20 22:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:15:29] [INFO ] [Nat]Absence check using state equation in 3092 ms returned sat
[2022-05-20 22:15:32] [INFO ] Deduced a trap composed of 29 places in 2337 ms of which 14 ms to minimize.
[2022-05-20 22:15: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 22:15:33] [INFO ] [Real]Absence check using 401 positive place invariants in 289 ms returned sat
[2022-05-20 22:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:15:36] [INFO ] [Real]Absence check using state equation in 3420 ms returned sat
[2022-05-20 22:15:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:15:37] [INFO ] [Nat]Absence check using 401 positive place invariants in 292 ms returned sat
[2022-05-20 22:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:15:41] [INFO ] [Nat]Absence check using state equation in 3467 ms returned sat
[2022-05-20 22:15:43] [INFO ] Deduced a trap composed of 34 places in 2136 ms of which 10 ms to minimize.
[2022-05-20 22:15:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 22:15:44] [INFO ] [Real]Absence check using 401 positive place invariants in 280 ms returned sat
[2022-05-20 22:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:15:47] [INFO ] [Real]Absence check using state equation in 3434 ms returned sat
[2022-05-20 22:15:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:15:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 277 ms returned sat
[2022-05-20 22:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:15:52] [INFO ] [Nat]Absence check using state equation in 3231 ms returned sat
[2022-05-20 22:15:54] [INFO ] Deduced a trap composed of 39 places in 2206 ms of which 5 ms to minimize.
[2022-05-20 22:15:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 22:15:55] [INFO ] [Real]Absence check using 401 positive place invariants in 276 ms returned sat
[2022-05-20 22:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:15:59] [INFO ] [Real]Absence check using state equation in 3384 ms returned sat
[2022-05-20 22:15:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:16:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 271 ms returned sat
[2022-05-20 22:16:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:16:03] [INFO ] [Nat]Absence check using state equation in 3459 ms returned sat
[2022-05-20 22:16:06] [INFO ] Deduced a trap composed of 44 places in 2289 ms of which 20 ms to minimize.
[2022-05-20 22:16:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 5003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions removed 1601 transitions
Trivial Post-agglo rules discarded 1601 transitions
Performed 1601 trivial Post agglomeration. Transition count delta: 1601
Iterating post reduction 0 with 1601 rules applied. Total rules applied 1601 place count 5003 transition count 3402
Reduce places removed 1601 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 1603 rules applied. Total rules applied 3204 place count 3402 transition count 3400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3205 place count 3401 transition count 3400
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 3205 place count 3401 transition count 3001
Deduced a syphon composed of 399 places in 10 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 4003 place count 3002 transition count 3001
Discarding 698 places :
Symmetric choice reduction at 3 with 698 rule applications. Total rules 4701 place count 2304 transition count 2303
Iterating global reduction 3 with 698 rules applied. Total rules applied 5399 place count 2304 transition count 2303
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 297 Pre rules applied. Total rules applied 5399 place count 2304 transition count 2006
Deduced a syphon composed of 297 places in 6 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 3 with 594 rules applied. Total rules applied 5993 place count 2007 transition count 2006
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 3 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 7797 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7999 place count 1004 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8201 place count 903 transition count 1302
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 8391 place count 808 transition count 1396
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8392 place count 808 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8393 place count 807 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8394 place count 806 transition count 1394
Applied a total of 8394 rules in 1615 ms. Remains 806 /5003 variables (removed 4197) and now considering 1394/5003 (removed 3609) transitions.
Finished structural reductions, in 1 iterations. Remains : 806/5003 places, 1394/5003 transitions.
// Phase 1: matrix 1394 rows 806 cols
[2022-05-20 22:16:07] [INFO ] Computed 400 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 269 resets, run finished after 8114 ms. (steps per millisecond=123 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 961891 steps, including 27 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
Interrupted Best-First random walk after 949722 steps, including 24 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
Interrupted Best-First random walk after 933494 steps, including 34 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 0
// Phase 1: matrix 1394 rows 806 cols
[2022-05-20 22:16:30] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-20 22:16:31] [INFO ] [Real]Absence check using 400 positive place invariants in 58 ms returned sat
[2022-05-20 22:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:16:31] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-05-20 22:16:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:16:31] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2022-05-20 22:16:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:16:31] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-05-20 22:16:32] [INFO ] Computed and/alt/rep : 1391/4301/1391 causal constraints (skipped 0 transitions) in 72 ms.
[2022-05-20 22:16:52] [INFO ] Added : 960 causal constraints over 192 iterations in 20314 ms.(timeout) Result :sat
Minimization took 3002 ms.
[2022-05-20 22:16:55] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 22:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:16:55] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-05-20 22:16:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:16:56] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2022-05-20 22:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:16:56] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2022-05-20 22:16:56] [INFO ] Computed and/alt/rep : 1391/4301/1391 causal constraints (skipped 0 transitions) in 72 ms.
[2022-05-20 22:17:16] [INFO ] Added : 920 causal constraints over 184 iterations in 20327 ms.(timeout) Result :sat
Minimization took 3005 ms.
[2022-05-20 22:17:19] [INFO ] [Real]Absence check using 400 positive place invariants in 49 ms returned sat
[2022-05-20 22:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:17:20] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2022-05-20 22:17:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:17:20] [INFO ] [Nat]Absence check using 400 positive place invariants in 50 ms returned sat
[2022-05-20 22:17:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:17:20] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2022-05-20 22:17:20] [INFO ] Computed and/alt/rep : 1391/4301/1391 causal constraints (skipped 0 transitions) in 63 ms.
[2022-05-20 22:17:40] [INFO ] Added : 1005 causal constraints over 201 iterations in 20143 ms.(timeout) Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 806 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 806/806 places, 1394/1394 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 0 with 1 rules applied. Total rules applied 1 place count 806 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 805 transition count 1393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 804 transition count 1395
Applied a total of 4 rules in 85 ms. Remains 804 /806 variables (removed 2) and now considering 1395/1394 (removed -1) transitions.
Finished structural reductions, in 1 iterations. Remains : 804/806 places, 1395/1394 transitions.
// Phase 1: matrix 1395 rows 804 cols
[2022-05-20 22:17:44] [INFO ] Computed 400 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 265 resets, run finished after 7694 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 979598 steps, including 19 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen 0
Interrupted Best-First random walk after 983091 steps, including 33 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 0
Interrupted Best-First random walk after 981107 steps, including 41 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 0
// Phase 1: matrix 1395 rows 804 cols
[2022-05-20 22:18:06] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:18:06] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 22:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:18:07] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-05-20 22:18:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:18:07] [INFO ] [Nat]Absence check using 400 positive place invariants in 50 ms returned sat
[2022-05-20 22:18:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:18:07] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2022-05-20 22:18:07] [INFO ] Computed and/alt/rep : 1392/4322/1392 causal constraints (skipped 0 transitions) in 61 ms.
[2022-05-20 22:18:28] [INFO ] Added : 955 causal constraints over 191 iterations in 20200 ms.(timeout) Result :sat
Minimization took 1982 ms.
[2022-05-20 22:18:30] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 22:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:18:30] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2022-05-20 22:18:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:18:30] [INFO ] [Nat]Absence check using 400 positive place invariants in 48 ms returned sat
[2022-05-20 22:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:18:31] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-05-20 22:18:31] [INFO ] Computed and/alt/rep : 1392/4322/1392 causal constraints (skipped 0 transitions) in 75 ms.
[2022-05-20 22:18:51] [INFO ] Added : 980 causal constraints over 196 iterations in 20177 ms.(timeout) Result :sat
Minimization took 3000 ms.
[2022-05-20 22:18:54] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 22:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:18:54] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-05-20 22:18:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:18:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 48 ms returned sat
[2022-05-20 22:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:18:55] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2022-05-20 22:18:55] [INFO ] Computed and/alt/rep : 1392/4322/1392 causal constraints (skipped 0 transitions) in 61 ms.
[2022-05-20 22:19:15] [INFO ] Added : 950 causal constraints over 190 iterations in 20165 ms.(timeout) Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ShieldRVt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 804 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 804/804 places, 1395/1395 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 803 transition count 1395
Applied a total of 2 rules in 50 ms. Remains 803 /804 variables (removed 1) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 803/804 places, 1395/1395 transitions.
// Phase 1: matrix 1395 rows 803 cols
[2022-05-20 22:19:19] [INFO ] Computed 400 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 264 resets, run finished after 7609 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 981321 steps, including 24 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 0
Interrupted Best-First random walk after 978112 steps, including 27 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen 0
// Phase 1: matrix 1395 rows 803 cols
[2022-05-20 22:19:37] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:19:37] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 22:19:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:19:37] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2022-05-20 22:19:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:19:37] [INFO ] [Nat]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-20 22:19:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:19:38] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2022-05-20 22:19:38] [INFO ] Computed and/alt/rep : 1392/4332/1392 causal constraints (skipped 0 transitions) in 68 ms.
[2022-05-20 22:19:58] [INFO ] Added : 895 causal constraints over 179 iterations in 20180 ms.(timeout) Result :sat
Minimization took 3002 ms.
[2022-05-20 22:20:01] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-20 22:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:20:02] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2022-05-20 22:20:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:20:02] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 22:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:20:02] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2022-05-20 22:20:02] [INFO ] Computed and/alt/rep : 1392/4332/1392 causal constraints (skipped 0 transitions) in 61 ms.
[2022-05-20 22:20:22] [INFO ] Added : 945 causal constraints over 189 iterations in 20179 ms.(timeout) Result :sat
Minimization took 1689 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ShieldRVt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 803/803 places, 1395/1395 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 802 transition count 1395
Applied a total of 2 rules in 48 ms. Remains 802 /803 variables (removed 1) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 802/803 places, 1395/1395 transitions.
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:20:25] [INFO ] Computed 400 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 314 resets, run finished after 7537 ms. (steps per millisecond=132 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 980479 steps, including 32 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 0
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:20:38] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-20 22:20:38] [INFO ] [Real]Absence check using 400 positive place invariants in 49 ms returned sat
[2022-05-20 22:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:20:38] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2022-05-20 22:20:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:20:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-05-20 22:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:20:39] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2022-05-20 22:20:39] [INFO ] Computed and/alt/rep : 1392/4338/1392 causal constraints (skipped 0 transitions) in 67 ms.
[2022-05-20 22:20:59] [INFO ] Added : 930 causal constraints over 186 iterations in 20136 ms.(timeout) Result :sat
Minimization took 1340 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 802/802 places, 1395/1395 transitions.
Applied a total of 0 rules in 29 ms. Remains 802 /802 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 1395/1395 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 802/802 places, 1395/1395 transitions.
Applied a total of 0 rules in 25 ms. Remains 802 /802 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:01] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:21:02] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:02] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:21:03] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
[2022-05-20 22:21:03] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:03] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-20 22:21:04] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 1395/1395 transitions.
Starting property specific reduction for ShieldRVt-PT-100B-UpperBounds-10
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:04] [INFO ] Computed 400 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:04] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 22:21:04] [INFO ] [Real]Absence check using 400 positive place invariants in 55 ms returned sat
[2022-05-20 22:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:21:04] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2022-05-20 22:21:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:21:04] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 22:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:21:05] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2022-05-20 22:21:05] [INFO ] Computed and/alt/rep : 1392/4338/1392 causal constraints (skipped 0 transitions) in 61 ms.
[2022-05-20 22:21:10] [INFO ] Deduced a trap composed of 2 places in 385 ms of which 1 ms to minimize.
[2022-05-20 22:21:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 802/802 places, 1395/1395 transitions.
Applied a total of 0 rules in 36 ms. Remains 802 /802 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 1395/1395 transitions.
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:10] [INFO ] Computed 400 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 250 resets, run finished after 7596 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 971708 steps, including 27 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen 0
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:22] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:21:23] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 22:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:21:23] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2022-05-20 22:21:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:21:23] [INFO ] [Nat]Absence check using 400 positive place invariants in 79 ms returned sat
[2022-05-20 22:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:21:23] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2022-05-20 22:21:24] [INFO ] Computed and/alt/rep : 1392/4338/1392 causal constraints (skipped 0 transitions) in 66 ms.
[2022-05-20 22:21:44] [INFO ] Added : 930 causal constraints over 186 iterations in 20165 ms.(timeout) Result :sat
Minimization took 1356 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 802/802 places, 1395/1395 transitions.
Applied a total of 0 rules in 25 ms. Remains 802 /802 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 1395/1395 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 802/802 places, 1395/1395 transitions.
Applied a total of 0 rules in 25 ms. Remains 802 /802 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:46] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:21:47] [INFO ] Implicit Places using invariants in 578 ms returned []
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:47] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:21:48] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2022-05-20 22:21:48] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1395 rows 802 cols
[2022-05-20 22:21:48] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:21:48] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 1395/1395 transitions.
Ending property specific reduction for ShieldRVt-PT-100B-UpperBounds-10 in 44844 ms.
[2022-05-20 22:21:49] [INFO ] Flatten gal took : 164 ms
[2022-05-20 22:21:49] [INFO ] Applying decomposition
[2022-05-20 22:21:49] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17252725469823437784.txt' '-o' '/tmp/graph17252725469823437784.bin' '-w' '/tmp/graph17252725469823437784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17252725469823437784.bin' '-l' '-1' '-v' '-w' '/tmp/graph17252725469823437784.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:21:49] [INFO ] Decomposing Gal with order
[2022-05-20 22:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:21:49] [INFO ] Removed a total of 2769 redundant transitions.
[2022-05-20 22:21:50] [INFO ] Flatten gal took : 168 ms
[2022-05-20 22:21:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1574 labels/synchronizations in 67 ms.
[2022-05-20 22:21:50] [INFO ] Time to serialize gal into /tmp/UpperBounds4508573723801232003.gal : 43 ms
[2022-05-20 22:21:50] [INFO ] Time to serialize properties into /tmp/UpperBounds2267665647485931520.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4508573723801232003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2267665647485931520.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds2267665647485931520.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.1645e+120,0.186632,12004,80,11,5880,130,485,8978,32,191,0
Total reachable state count : 5.164499756173817179311838344006023748659e+120

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property ShieldRVt-PT-100B-UpperBounds-10 :0 <= i1.u13.p261 <= 1
FORMULA ShieldRVt-PT-100B-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-100B-UpperBounds-10,0,0.189223,12004,1,0,5880,130,844,8978,47,191,871
Total runtime 390607 ms.

BK_STOP 1653085310495

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-100B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026201053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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