fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r233-tall-165286037300238
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ShieldPPPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
423.336 58152.00 74740.00 439.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r233-tall-165286037300238.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 gold2021
Input is ShieldPPPt-PT-020B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037300238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 376K 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-020B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653032979942

Running Version 0
[2022-05-20 07:49:41] [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 07:49:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:49:41] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2022-05-20 07:49:41] [INFO ] Transformed 1563 places.
[2022-05-20 07:49:41] [INFO ] Transformed 1423 transitions.
[2022-05-20 07:49:41] [INFO ] Found NUPN structural information;
[2022-05-20 07:49:41] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 184 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 71 ms.
// Phase 1: matrix 1423 rows 1563 cols
[2022-05-20 07:49:41] [INFO ] Computed 221 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :8
FORMULA ShieldPPPt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
// Phase 1: matrix 1423 rows 1563 cols
[2022-05-20 07:49:41] [INFO ] Computed 221 place invariants in 15 ms
[2022-05-20 07:49:42] [INFO ] [Real]Absence check using 221 positive place invariants in 86 ms returned sat
[2022-05-20 07:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:42] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2022-05-20 07:49:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:49:43] [INFO ] [Nat]Absence check using 221 positive place invariants in 80 ms returned sat
[2022-05-20 07:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:43] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2022-05-20 07:49:44] [INFO ] Deduced a trap composed of 17 places in 390 ms of which 14 ms to minimize.
[2022-05-20 07:49:44] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 2 ms to minimize.
[2022-05-20 07:49:45] [INFO ] Deduced a trap composed of 25 places in 326 ms of which 4 ms to minimize.
[2022-05-20 07:49:45] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 1 ms to minimize.
[2022-05-20 07:49:45] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 1 ms to minimize.
[2022-05-20 07:49:46] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 1 ms to minimize.
[2022-05-20 07:49:46] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 1 ms to minimize.
[2022-05-20 07:49:46] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 1 ms to minimize.
[2022-05-20 07:49:47] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 1 ms to minimize.
[2022-05-20 07:49:47] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 1 ms to minimize.
[2022-05-20 07:49:47] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 1 ms to minimize.
[2022-05-20 07:49:48] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2022-05-20 07:49:48] [INFO ] Deduced a trap composed of 15 places in 593 ms of which 14 ms to minimize.
[2022-05-20 07:49:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:49:48] [INFO ] [Real]Absence check using 221 positive place invariants in 88 ms returned sat
[2022-05-20 07:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:49] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2022-05-20 07:49:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:49:49] [INFO ] [Nat]Absence check using 221 positive place invariants in 72 ms returned sat
[2022-05-20 07:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:50] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2022-05-20 07:49:50] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 0 ms to minimize.
[2022-05-20 07:49:51] [INFO ] Deduced a trap composed of 39 places in 324 ms of which 1 ms to minimize.
[2022-05-20 07:49:51] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 2 ms to minimize.
[2022-05-20 07:49:51] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 1 ms to minimize.
[2022-05-20 07:49:52] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 1 ms to minimize.
[2022-05-20 07:49:52] [INFO ] Deduced a trap composed of 55 places in 295 ms of which 1 ms to minimize.
[2022-05-20 07:49:52] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 0 ms to minimize.
[2022-05-20 07:49:53] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 1 ms to minimize.
[2022-05-20 07:49:53] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 2 ms to minimize.
[2022-05-20 07:49:53] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 1 ms to minimize.
[2022-05-20 07:49:54] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 1 ms to minimize.
[2022-05-20 07:49:54] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 1 ms to minimize.
[2022-05-20 07:49:55] [INFO ] Deduced a trap composed of 15 places in 583 ms of which 7 ms to minimize.
[2022-05-20 07:49:55] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:49:55] [INFO ] [Real]Absence check using 221 positive place invariants in 71 ms returned sat
[2022-05-20 07:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:55] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2022-05-20 07:49:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:49:56] [INFO ] [Nat]Absence check using 221 positive place invariants in 72 ms returned sat
[2022-05-20 07:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:56] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2022-05-20 07:49:57] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 1 ms to minimize.
[2022-05-20 07:49:57] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 1 ms to minimize.
[2022-05-20 07:49:57] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2022-05-20 07:49:58] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 1 ms to minimize.
[2022-05-20 07:49:58] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 1 ms to minimize.
[2022-05-20 07:49:58] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 0 ms to minimize.
[2022-05-20 07:49:59] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 1 ms to minimize.
[2022-05-20 07:49:59] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 6 ms to minimize.
[2022-05-20 07:49:59] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 1 ms to minimize.
[2022-05-20 07:50:00] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 0 ms to minimize.
[2022-05-20 07:50:00] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 1 ms to minimize.
[2022-05-20 07:50:00] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 2 ms to minimize.
[2022-05-20 07:50:01] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 0 ms to minimize.
[2022-05-20 07:50:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:50:01] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2022-05-20 07:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:02] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2022-05-20 07:50:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:50:02] [INFO ] [Nat]Absence check using 221 positive place invariants in 73 ms returned sat
[2022-05-20 07:50:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:02] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2022-05-20 07:50:03] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 1 ms to minimize.
[2022-05-20 07:50:03] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 1 ms to minimize.
[2022-05-20 07:50:04] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 1 ms to minimize.
[2022-05-20 07:50:04] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 1 ms to minimize.
[2022-05-20 07:50:04] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 0 ms to minimize.
[2022-05-20 07:50:05] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 1 ms to minimize.
[2022-05-20 07:50:05] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 1 ms to minimize.
[2022-05-20 07:50:05] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 2 ms to minimize.
[2022-05-20 07:50:06] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 1 ms to minimize.
[2022-05-20 07:50:06] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 0 ms to minimize.
[2022-05-20 07:50:06] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 1 ms to minimize.
[2022-05-20 07:50:07] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 1 ms to minimize.
[2022-05-20 07:50:07] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2022-05-20 07:50: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:50:07] [INFO ] [Real]Absence check using 221 positive place invariants in 71 ms returned sat
[2022-05-20 07:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:08] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2022-05-20 07:50:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:50:08] [INFO ] [Nat]Absence check using 221 positive place invariants in 72 ms returned sat
[2022-05-20 07:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:09] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2022-05-20 07:50:09] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 1 ms to minimize.
[2022-05-20 07:50:09] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2022-05-20 07:50:10] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 1 ms to minimize.
[2022-05-20 07:50:10] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 9 ms to minimize.
[2022-05-20 07:50:10] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 1 ms to minimize.
[2022-05-20 07:50:11] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2022-05-20 07:50:11] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 1 ms to minimize.
[2022-05-20 07:50:11] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 0 ms to minimize.
[2022-05-20 07:50:11] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2022-05-20 07:50:12] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 0 ms to minimize.
[2022-05-20 07:50:12] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 1 ms to minimize.
[2022-05-20 07:50:12] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 2 ms to minimize.
[2022-05-20 07:50:13] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 1 ms to minimize.
[2022-05-20 07:50:13] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 1 ms to minimize.
[2022-05-20 07:50: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:50:13] [INFO ] [Real]Absence check using 221 positive place invariants in 76 ms returned sat
[2022-05-20 07:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:14] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2022-05-20 07:50:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:50:14] [INFO ] [Nat]Absence check using 221 positive place invariants in 73 ms returned sat
[2022-05-20 07:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:15] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2022-05-20 07:50:15] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 2 ms to minimize.
[2022-05-20 07:50:15] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 8 ms to minimize.
[2022-05-20 07:50:16] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 0 ms to minimize.
[2022-05-20 07:50:16] [INFO ] Deduced a trap composed of 20 places in 299 ms of which 1 ms to minimize.
[2022-05-20 07:50:16] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 1 ms to minimize.
[2022-05-20 07:50:17] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 1 ms to minimize.
[2022-05-20 07:50:17] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 1 ms to minimize.
[2022-05-20 07:50:17] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2022-05-20 07:50:18] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 1 ms to minimize.
[2022-05-20 07:50:18] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 1 ms to minimize.
[2022-05-20 07:50:18] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 1 ms to minimize.
[2022-05-20 07:50:19] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 1 ms to minimize.
[2022-05-20 07:50:19] [INFO ] Deduced a trap composed of 15 places in 563 ms of which 4 ms to minimize.
[2022-05-20 07:50:19] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:50:20] [INFO ] [Real]Absence check using 221 positive place invariants in 71 ms returned sat
[2022-05-20 07:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:20] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2022-05-20 07:50:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:50:20] [INFO ] [Nat]Absence check using 221 positive place invariants in 72 ms returned sat
[2022-05-20 07:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:21] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2022-05-20 07:50:21] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 1 ms to minimize.
[2022-05-20 07:50:22] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 1 ms to minimize.
[2022-05-20 07:50:22] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 1 ms to minimize.
[2022-05-20 07:50:22] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 1 ms to minimize.
[2022-05-20 07:50:23] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 1 ms to minimize.
[2022-05-20 07:50:23] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 1 ms to minimize.
[2022-05-20 07:50:24] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2022-05-20 07:50:24] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 1 ms to minimize.
[2022-05-20 07:50:24] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 1 ms to minimize.
[2022-05-20 07:50:25] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 1 ms to minimize.
[2022-05-20 07:50:25] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 1 ms to minimize.
[2022-05-20 07:50:25] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 1 ms to minimize.
[2022-05-20 07:50:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:50:25] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2022-05-20 07:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:26] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2022-05-20 07:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:50:26] [INFO ] [Nat]Absence check using 221 positive place invariants in 73 ms returned sat
[2022-05-20 07:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:50:27] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2022-05-20 07:50:27] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 1 ms to minimize.
[2022-05-20 07:50:28] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 1 ms to minimize.
[2022-05-20 07:50:28] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 1 ms to minimize.
[2022-05-20 07:50:28] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 1 ms to minimize.
[2022-05-20 07:50:29] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2022-05-20 07:50:29] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 1 ms to minimize.
[2022-05-20 07:50:29] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 1 ms to minimize.
[2022-05-20 07:50:30] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 1 ms to minimize.
[2022-05-20 07:50:30] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 1 ms to minimize.
[2022-05-20 07:50:30] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2022-05-20 07:50:31] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
[2022-05-20 07:50:31] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 1 ms to minimize.
[2022-05-20 07:50:31] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 0 ms to minimize.
[2022-05-20 07:50:31] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 381 transitions
Trivial Post-agglo rules discarded 381 transitions
Performed 381 trivial Post agglomeration. Transition count delta: 381
Iterating post reduction 0 with 381 rules applied. Total rules applied 381 place count 1563 transition count 1042
Reduce places removed 381 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 383 rules applied. Total rules applied 764 place count 1182 transition count 1040
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 766 place count 1181 transition count 1039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 767 place count 1180 transition count 1039
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 767 place count 1180 transition count 961
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 923 place count 1102 transition count 961
Discarding 137 places :
Symmetric choice reduction at 4 with 137 rule applications. Total rules 1060 place count 965 transition count 824
Iterating global reduction 4 with 137 rules applied. Total rules applied 1197 place count 965 transition count 824
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1197 place count 965 transition count 768
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1309 place count 909 transition count 768
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 2 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 4 with 684 rules applied. Total rules applied 1993 place count 567 transition count 426
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 2107 place count 510 transition count 426
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 2164 place count 510 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2165 place count 509 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2166 place count 508 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2166 place count 508 transition count 423
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2170 place count 506 transition count 423
Applied a total of 2170 rules in 426 ms. Remains 506 /1563 variables (removed 1057) and now considering 423/1423 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 506/1563 places, 423/1423 transitions.
// Phase 1: matrix 423 rows 506 cols
[2022-05-20 07:50:32] [INFO ] Computed 220 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4810 ms. (steps per millisecond=207 ) properties (out of 8) seen :8
FORMULA ShieldPPPt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653033038094

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-020B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ShieldPPPt-PT-020B, 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 r233-tall-165286037300238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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