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-165286025600653.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 ShieldPPPt-PT-030B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 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 569K 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 ShieldPPPt-PT-030B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653027678805

Running Version 202205111006
[2022-05-20 06:21: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 06:21:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 06:21:20] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2022-05-20 06:21:20] [INFO ] Transformed 2343 places.
[2022-05-20 06:21:20] [INFO ] Transformed 2133 transitions.
[2022-05-20 06:21:20] [INFO ] Found NUPN structural information;
[2022-05-20 06:21:20] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 381 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 2133 rows 2343 cols
[2022-05-20 06:21:20] [INFO ] Computed 331 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
// Phase 1: matrix 2133 rows 2343 cols
[2022-05-20 06:21:20] [INFO ] Computed 331 place invariants in 21 ms
[2022-05-20 06:21:21] [INFO ] [Real]Absence check using 331 positive place invariants in 139 ms returned sat
[2022-05-20 06:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:22] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2022-05-20 06:21:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:21:22] [INFO ] [Nat]Absence check using 331 positive place invariants in 132 ms returned sat
[2022-05-20 06:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:23] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2022-05-20 06:21:24] [INFO ] Deduced a trap composed of 29 places in 600 ms of which 8 ms to minimize.
[2022-05-20 06:21:25] [INFO ] Deduced a trap composed of 25 places in 627 ms of which 6 ms to minimize.
[2022-05-20 06:21:25] [INFO ] Deduced a trap composed of 20 places in 564 ms of which 4 ms to minimize.
[2022-05-20 06:21:26] [INFO ] Deduced a trap composed of 30 places in 541 ms of which 3 ms to minimize.
[2022-05-20 06:21:27] [INFO ] Deduced a trap composed of 28 places in 568 ms of which 2 ms to minimize.
[2022-05-20 06:21:27] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 1 ms to minimize.
[2022-05-20 06:21:27] [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 06:21:28] [INFO ] [Real]Absence check using 331 positive place invariants in 119 ms returned sat
[2022-05-20 06:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:29] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2022-05-20 06:21:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:21:29] [INFO ] [Nat]Absence check using 331 positive place invariants in 115 ms returned sat
[2022-05-20 06:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:30] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2022-05-20 06:21:31] [INFO ] Deduced a trap composed of 22 places in 539 ms of which 2 ms to minimize.
[2022-05-20 06:21:31] [INFO ] Deduced a trap composed of 17 places in 520 ms of which 1 ms to minimize.
[2022-05-20 06:21:32] [INFO ] Deduced a trap composed of 22 places in 518 ms of which 2 ms to minimize.
[2022-05-20 06:21:32] [INFO ] Deduced a trap composed of 30 places in 526 ms of which 2 ms to minimize.
[2022-05-20 06:21:33] [INFO ] Deduced a trap composed of 19 places in 510 ms of which 1 ms to minimize.
[2022-05-20 06:21:33] [INFO ] Deduced a trap composed of 25 places in 507 ms of which 1 ms to minimize.
[2022-05-20 06:21:34] [INFO ] Deduced a trap composed of 22 places in 507 ms of which 2 ms to minimize.
[2022-05-20 06:21:34] [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 06:21:34] [INFO ] [Real]Absence check using 331 positive place invariants in 115 ms returned sat
[2022-05-20 06:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:35] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2022-05-20 06:21:36] [INFO ] Deduced a trap composed of 23 places in 534 ms of which 2 ms to minimize.
[2022-05-20 06:21:37] [INFO ] Deduced a trap composed of 22 places in 517 ms of which 2 ms to minimize.
[2022-05-20 06:21:37] [INFO ] Deduced a trap composed of 23 places in 498 ms of which 2 ms to minimize.
[2022-05-20 06:21:38] [INFO ] Deduced a trap composed of 21 places in 510 ms of which 2 ms to minimize.
[2022-05-20 06:21:38] [INFO ] Deduced a trap composed of 21 places in 499 ms of which 1 ms to minimize.
[2022-05-20 06:21:39] [INFO ] Deduced a trap composed of 18 places in 477 ms of which 1 ms to minimize.
[2022-05-20 06:21:40] [INFO ] Deduced a trap composed of 18 places in 520 ms of which 1 ms to minimize.
[2022-05-20 06:21: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 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:2620)
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 06:21:40] [INFO ] [Real]Absence check using 331 positive place invariants in 114 ms returned sat
[2022-05-20 06:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:41] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2022-05-20 06:21:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:21:41] [INFO ] [Nat]Absence check using 331 positive place invariants in 119 ms returned sat
[2022-05-20 06:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:42] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2022-05-20 06:21:43] [INFO ] Deduced a trap composed of 19 places in 510 ms of which 1 ms to minimize.
[2022-05-20 06:21:43] [INFO ] Deduced a trap composed of 27 places in 529 ms of which 1 ms to minimize.
[2022-05-20 06:21:44] [INFO ] Deduced a trap composed of 20 places in 534 ms of which 1 ms to minimize.
[2022-05-20 06:21:44] [INFO ] Deduced a trap composed of 33 places in 524 ms of which 2 ms to minimize.
[2022-05-20 06:21:45] [INFO ] Deduced a trap composed of 29 places in 533 ms of which 1 ms to minimize.
[2022-05-20 06:21:46] [INFO ] Deduced a trap composed of 21 places in 513 ms of which 1 ms to minimize.
[2022-05-20 06:21:46] [INFO ] Deduced a trap composed of 19 places in 547 ms of which 1 ms to minimize.
[2022-05-20 06:21:46] [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)
[2022-05-20 06:21:47] [INFO ] [Real]Absence check using 331 positive place invariants in 113 ms returned sat
[2022-05-20 06:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:48] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2022-05-20 06:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:21:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 118 ms returned sat
[2022-05-20 06:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:49] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2022-05-20 06:21:49] [INFO ] Deduced a trap composed of 24 places in 508 ms of which 2 ms to minimize.
[2022-05-20 06:21:50] [INFO ] Deduced a trap composed of 20 places in 493 ms of which 1 ms to minimize.
[2022-05-20 06:21:51] [INFO ] Deduced a trap composed of 26 places in 542 ms of which 1 ms to minimize.
[2022-05-20 06:21:51] [INFO ] Deduced a trap composed of 26 places in 501 ms of which 1 ms to minimize.
[2022-05-20 06:21:52] [INFO ] Deduced a trap composed of 21 places in 493 ms of which 1 ms to minimize.
[2022-05-20 06:21:52] [INFO ] Deduced a trap composed of 22 places in 477 ms of which 1 ms to minimize.
[2022-05-20 06:21:53] [INFO ] Deduced a trap composed of 38 places in 497 ms of which 1 ms to minimize.
[2022-05-20 06:21: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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 06:21:53] [INFO ] [Real]Absence check using 331 positive place invariants in 118 ms returned sat
[2022-05-20 06:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:54] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2022-05-20 06:21:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:21:55] [INFO ] [Nat]Absence check using 331 positive place invariants in 114 ms returned sat
[2022-05-20 06:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:21:56] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2022-05-20 06:21:56] [INFO ] Deduced a trap composed of 21 places in 533 ms of which 1 ms to minimize.
[2022-05-20 06:21:57] [INFO ] Deduced a trap composed of 18 places in 487 ms of which 1 ms to minimize.
[2022-05-20 06:21:57] [INFO ] Deduced a trap composed of 21 places in 474 ms of which 1 ms to minimize.
[2022-05-20 06:21:58] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 1 ms to minimize.
[2022-05-20 06:21:58] [INFO ] Deduced a trap composed of 20 places in 476 ms of which 1 ms to minimize.
[2022-05-20 06:21:59] [INFO ] Deduced a trap composed of 18 places in 444 ms of which 2 ms to minimize.
[2022-05-20 06:21:59] [INFO ] Deduced a trap composed of 25 places in 452 ms of which 1 ms to minimize.
[2022-05-20 06:21:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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 06:22:00] [INFO ] [Real]Absence check using 331 positive place invariants in 115 ms returned sat
[2022-05-20 06:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:01] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2022-05-20 06:22:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:22:01] [INFO ] [Nat]Absence check using 331 positive place invariants in 116 ms returned sat
[2022-05-20 06:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:02] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2022-05-20 06:22:03] [INFO ] Deduced a trap composed of 25 places in 550 ms of which 2 ms to minimize.
[2022-05-20 06:22:03] [INFO ] Deduced a trap composed of 18 places in 569 ms of which 1 ms to minimize.
[2022-05-20 06:22:04] [INFO ] Deduced a trap composed of 23 places in 539 ms of which 2 ms to minimize.
[2022-05-20 06:22:05] [INFO ] Deduced a trap composed of 20 places in 542 ms of which 1 ms to minimize.
[2022-05-20 06:22:05] [INFO ] Deduced a trap composed of 22 places in 550 ms of which 2 ms to minimize.
[2022-05-20 06:22:06] [INFO ] Deduced a trap composed of 29 places in 544 ms of which 2 ms to minimize.
[2022-05-20 06:22:07] [INFO ] Deduced a trap composed of 24 places in 1026 ms of which 2 ms to minimize.
[2022-05-20 06:22:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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 06:22:07] [INFO ] [Real]Absence check using 331 positive place invariants in 127 ms returned sat
[2022-05-20 06:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:08] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2022-05-20 06:22:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:22:09] [INFO ] [Nat]Absence check using 331 positive place invariants in 117 ms returned sat
[2022-05-20 06:22:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:10] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2022-05-20 06:22:10] [INFO ] Deduced a trap composed of 30 places in 547 ms of which 2 ms to minimize.
[2022-05-20 06:22:11] [INFO ] Deduced a trap composed of 20 places in 568 ms of which 2 ms to minimize.
[2022-05-20 06:22:11] [INFO ] Deduced a trap composed of 23 places in 568 ms of which 2 ms to minimize.
[2022-05-20 06:22:12] [INFO ] Deduced a trap composed of 25 places in 560 ms of which 2 ms to minimize.
[2022-05-20 06:22:13] [INFO ] Deduced a trap composed of 20 places in 566 ms of which 2 ms to minimize.
[2022-05-20 06:22:13] [INFO ] Deduced a trap composed of 20 places in 532 ms of which 1 ms to minimize.
[2022-05-20 06:22:13] [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: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 06:22:14] [INFO ] [Real]Absence check using 331 positive place invariants in 113 ms returned sat
[2022-05-20 06:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:15] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2022-05-20 06:22:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:22:15] [INFO ] [Nat]Absence check using 331 positive place invariants in 115 ms returned sat
[2022-05-20 06:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:16] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2022-05-20 06:22:17] [INFO ] Deduced a trap composed of 18 places in 539 ms of which 1 ms to minimize.
[2022-05-20 06:22:17] [INFO ] Deduced a trap composed of 18 places in 531 ms of which 1 ms to minimize.
[2022-05-20 06:22:18] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 2 ms to minimize.
[2022-05-20 06:22:18] [INFO ] Deduced a trap composed of 19 places in 513 ms of which 2 ms to minimize.
[2022-05-20 06:22:19] [INFO ] Deduced a trap composed of 23 places in 521 ms of which 2 ms to minimize.
[2022-05-20 06:22:20] [INFO ] Deduced a trap composed of 30 places in 520 ms of which 2 ms to minimize.
[2022-05-20 06:22:20] [INFO ] Deduced a trap composed of 26 places in 516 ms of which 1 ms to minimize.
[2022-05-20 06:22:20] [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: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 06:22:21] [INFO ] [Real]Absence check using 331 positive place invariants in 118 ms returned sat
[2022-05-20 06:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:21] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2022-05-20 06:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:22:22] [INFO ] [Nat]Absence check using 331 positive place invariants in 116 ms returned sat
[2022-05-20 06:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:23] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2022-05-20 06:22:23] [INFO ] Deduced a trap composed of 20 places in 600 ms of which 1 ms to minimize.
[2022-05-20 06:22:24] [INFO ] Deduced a trap composed of 20 places in 580 ms of which 1 ms to minimize.
[2022-05-20 06:22:25] [INFO ] Deduced a trap composed of 22 places in 542 ms of which 2 ms to minimize.
[2022-05-20 06:22:25] [INFO ] Deduced a trap composed of 23 places in 561 ms of which 1 ms to minimize.
[2022-05-20 06:22:26] [INFO ] Deduced a trap composed of 21 places in 545 ms of which 1 ms to minimize.
[2022-05-20 06:22:27] [INFO ] Deduced a trap composed of 27 places in 554 ms of which 1 ms to minimize.
[2022-05-20 06:22:27] [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: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, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 2343 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 569 transitions
Trivial Post-agglo rules discarded 569 transitions
Performed 569 trivial Post agglomeration. Transition count delta: 569
Iterating post reduction 0 with 569 rules applied. Total rules applied 569 place count 2343 transition count 1564
Reduce places removed 569 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 571 rules applied. Total rules applied 1140 place count 1774 transition count 1562
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 1142 place count 1773 transition count 1561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1143 place count 1772 transition count 1561
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 119 Pre rules applied. Total rules applied 1143 place count 1772 transition count 1442
Deduced a syphon composed of 119 places in 2 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1381 place count 1653 transition count 1442
Discarding 206 places :
Symmetric choice reduction at 4 with 206 rule applications. Total rules 1587 place count 1447 transition count 1236
Iterating global reduction 4 with 206 rules applied. Total rules applied 1793 place count 1447 transition count 1236
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 1793 place count 1447 transition count 1147
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1971 place count 1358 transition count 1147
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 2 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 4 with 1016 rules applied. Total rules applied 2987 place count 850 transition count 639
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 3163 place count 762 transition count 639
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3165 place count 762 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3167 place count 760 transition count 637
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 3254 place count 760 transition count 637
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3255 place count 759 transition count 636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3256 place count 758 transition count 636
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3256 place count 758 transition count 634
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3260 place count 756 transition count 634
Applied a total of 3260 rules in 803 ms. Remains 756 /2343 variables (removed 1587) and now considering 634/2133 (removed 1499) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/2343 places, 634/2133 transitions.
// Phase 1: matrix 634 rows 756 cols
[2022-05-20 06:22:27] [INFO ] Computed 330 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5391 ms. (steps per millisecond=185 ) properties (out of 10) seen :6
FORMULA ShieldPPPt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3427 ms. (steps per millisecond=291 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3395 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3443 ms. (steps per millisecond=290 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3378 ms. (steps per millisecond=296 ) properties (out of 4) seen :0
// Phase 1: matrix 634 rows 756 cols
[2022-05-20 06:22:46] [INFO ] Computed 330 place invariants in 10 ms
[2022-05-20 06:22:47] [INFO ] [Real]Absence check using 330 positive place invariants in 39 ms returned sat
[2022-05-20 06:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:47] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-05-20 06:22:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:22:47] [INFO ] [Nat]Absence check using 330 positive place invariants in 44 ms returned sat
[2022-05-20 06:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:47] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-05-20 06:22:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:22:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-20 06:22:47] [INFO ] Computed and/alt/rep : 630/1469/630 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-20 06:22:54] [INFO ] Added : 599 causal constraints over 121 iterations in 6971 ms. Result :sat
Minimization took 607 ms.
[2022-05-20 06:22:55] [INFO ] [Real]Absence check using 330 positive place invariants in 42 ms returned sat
[2022-05-20 06:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:55] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-05-20 06:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:22:55] [INFO ] [Nat]Absence check using 330 positive place invariants in 43 ms returned sat
[2022-05-20 06:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:22:55] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2022-05-20 06:22:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-20 06:22:55] [INFO ] Computed and/alt/rep : 630/1469/630 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-20 06:23:02] [INFO ] Added : 601 causal constraints over 121 iterations in 6781 ms. Result :sat
Minimization took 733 ms.
[2022-05-20 06:23:03] [INFO ] [Real]Absence check using 330 positive place invariants in 43 ms returned sat
[2022-05-20 06:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:23:03] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-05-20 06:23:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:23:03] [INFO ] [Nat]Absence check using 330 positive place invariants in 44 ms returned sat
[2022-05-20 06:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:23:04] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-05-20 06:23:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-20 06:23:04] [INFO ] Computed and/alt/rep : 630/1469/630 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-20 06:23:11] [INFO ] Added : 603 causal constraints over 122 iterations in 7355 ms. Result :sat
Minimization took 429 ms.
[2022-05-20 06:23:12] [INFO ] [Real]Absence check using 330 positive place invariants in 42 ms returned sat
[2022-05-20 06:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 06:23:12] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-20 06:23:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 06:23:12] [INFO ] [Nat]Absence check using 330 positive place invariants in 42 ms returned sat
[2022-05-20 06:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 06:23:12] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-05-20 06:23:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-20 06:23:12] [INFO ] Computed and/alt/rep : 630/1469/630 causal constraints (skipped 0 transitions) in 29 ms.
[2022-05-20 06:23:19] [INFO ] Added : 607 causal constraints over 122 iterations in 7013 ms. Result :sat
Minimization took 1033 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ShieldPPPt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 123186 ms.

BK_STOP 1653027803130

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;