Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r415-oct2-167903730600088.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ShieldPPPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r415-oct2-167903730600088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679811359724

Running Version 202205111006
[2023-03-26 06:16:01] [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]
[2023-03-26 06:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-26 06:16:01] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2023-03-26 06:16:02] [INFO ] Transformed 7803 places.
[2023-03-26 06:16:02] [INFO ] Transformed 7103 transitions.
[2023-03-26 06:16:02] [INFO ] Found NUPN structural information;
[2023-03-26 06:16:02] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 967 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-26 06:16:02] [INFO ] Computed 1101 place invariants in 102 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 15) seen :6
FORMULA ShieldPPPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-26 06:16:03] [INFO ] Computed 1101 place invariants in 67 ms
[2023-03-26 06:16:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 1135 ms returned sat
[2023-03-26 06:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:08] [INFO ] [Real]Absence check using state equation in 2295 ms returned unknown
[2023-03-26 06:16:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 796 ms returned sat
[2023-03-26 06:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16: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 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.verifyPossible(DeadlockTester.java:901)
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)
[2023-03-26 06:16:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 757 ms returned sat
[2023-03-26 06:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:18] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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)
[2023-03-26 06:16:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 835 ms returned sat
[2023-03-26 06:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:23] [INFO ] [Real]Absence check using state equation in 2646 ms returned sat
[2023-03-26 06:16:33] [INFO ] Deduced a trap composed of 17 places in 10356 ms of which 23 ms to minimize.
[2023-03-26 06:16:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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)
[2023-03-26 06:16:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 813 ms returned sat
[2023-03-26 06:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:38] [INFO ] [Real]Absence check using state equation in 2712 ms returned unknown
[2023-03-26 06:16:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 839 ms returned sat
[2023-03-26 06:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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)
[2023-03-26 06:16:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 834 ms returned sat
[2023-03-26 06:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:48] [INFO ] [Real]Absence check using state equation in 2928 ms returned unknown
[2023-03-26 06:16:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 768 ms returned sat
[2023-03-26 06:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:54] [INFO ] [Real]Absence check using state equation in 2902 ms returned unknown
[2023-03-26 06:16:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 969 ms returned sat
[2023-03-26 06:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:16:59] [INFO ] [Real]Absence check using state equation in 2681 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 7803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1895 transitions
Trivial Post-agglo rules discarded 1895 transitions
Performed 1895 trivial Post agglomeration. Transition count delta: 1895
Iterating post reduction 0 with 1895 rules applied. Total rules applied 1895 place count 7803 transition count 5208
Reduce places removed 1895 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 1897 rules applied. Total rules applied 3792 place count 5908 transition count 5206
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 3797 place count 5907 transition count 5202
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3801 place count 5903 transition count 5202
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 399 Pre rules applied. Total rules applied 3801 place count 5903 transition count 4803
Deduced a syphon composed of 399 places in 22 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 4 with 798 rules applied. Total rules applied 4599 place count 5504 transition count 4803
Discarding 698 places :
Symmetric choice reduction at 4 with 698 rule applications. Total rules 5297 place count 4806 transition count 4105
Iterating global reduction 4 with 698 rules applied. Total rules applied 5995 place count 4806 transition count 4105
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 299 Pre rules applied. Total rules applied 5995 place count 4806 transition count 3806
Deduced a syphon composed of 299 places in 16 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 6593 place count 4507 transition count 3806
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 8 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 4 with 3396 rules applied. Total rules applied 9989 place count 2809 transition count 2108
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10191 place count 2708 transition count 2108
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10393 place count 2607 transition count 2108
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 6 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 10583 place count 2512 transition count 2108
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10584 place count 2512 transition count 2107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10585 place count 2511 transition count 2107
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 5 with 297 rules applied. Total rules applied 10882 place count 2511 transition count 2107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10883 place count 2510 transition count 2106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10884 place count 2509 transition count 2106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10884 place count 2509 transition count 2104
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10888 place count 2507 transition count 2104
Applied a total of 10888 rules in 3680 ms. Remains 2507 /7803 variables (removed 5296) and now considering 2104/7103 (removed 4999) transitions.
Finished structural reductions, in 1 iterations. Remains : 2507/7803 places, 2104/7103 transitions.
// Phase 1: matrix 2104 rows 2507 cols
[2023-03-26 06:17:02] [INFO ] Computed 1100 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14429 ms. (steps per millisecond=69 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 521549 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 0
Interrupted Best-First random walk after 491828 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 492649 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 500684 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
Interrupted Best-First random walk after 490533 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 496562 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
Interrupted Best-First random walk after 475261 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 478992 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
// Phase 1: matrix 2104 rows 2507 cols
[2023-03-26 06:17:57] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-26 06:17:57] [INFO ] [Real]Absence check using 1100 positive place invariants in 283 ms returned sat
[2023-03-26 06:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:17:58] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2023-03-26 06:17:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:17:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 255 ms returned sat
[2023-03-26 06:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:18:00] [INFO ] [Nat]Absence check using state equation in 1108 ms returned sat
[2023-03-26 06:18:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-26 06:18:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-26 06:18:01] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 145 ms.
[2023-03-26 06:18:21] [INFO ] Added : 570 causal constraints over 114 iterations in 20130 ms.(timeout) Result :sat
Minimization took 299 ms.
[2023-03-26 06:18:22] [INFO ] [Real]Absence check using 1100 positive place invariants in 223 ms returned sat
[2023-03-26 06:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:18:23] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2023-03-26 06:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:18:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 232 ms returned sat
[2023-03-26 06:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:18:25] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2023-03-26 06:18:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-26 06:18:25] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 2 ms to minimize.
[2023-03-26 06:18:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2023-03-26 06:18:25] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 129 ms.
[2023-03-26 06:18:45] [INFO ] Added : 585 causal constraints over 117 iterations in 20314 ms.(timeout) Result :sat
Minimization took 320 ms.
[2023-03-26 06:18:46] [INFO ] [Real]Absence check using 1100 positive place invariants in 291 ms returned sat
[2023-03-26 06:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:18:48] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2023-03-26 06:18:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:18:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 248 ms returned sat
[2023-03-26 06:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:18:49] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2023-03-26 06:18:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-26 06:18:50] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 2 ms to minimize.
[2023-03-26 06:18:50] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 2 ms to minimize.
[2023-03-26 06:18:50] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-26 06:18:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1023 ms
[2023-03-26 06:18:51] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 136 ms.
[2023-03-26 06:19:11] [INFO ] Added : 570 causal constraints over 114 iterations in 20054 ms.(timeout) Result :sat
Minimization took 268 ms.
[2023-03-26 06:19:12] [INFO ] [Real]Absence check using 1100 positive place invariants in 243 ms returned sat
[2023-03-26 06:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:19:13] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2023-03-26 06:19:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:19:13] [INFO ] [Nat]Absence check using 1100 positive place invariants in 221 ms returned sat
[2023-03-26 06:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:19:14] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2023-03-26 06:19:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-26 06:19:15] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-26 06:19:15] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-26 06:19:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 854 ms
[2023-03-26 06:19:15] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 144 ms.
[2023-03-26 06:19:35] [INFO ] Added : 600 causal constraints over 120 iterations in 20154 ms.(timeout) Result :sat
Minimization took 289 ms.
[2023-03-26 06:19:36] [INFO ] [Real]Absence check using 1100 positive place invariants in 222 ms returned sat
[2023-03-26 06:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:19:38] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2023-03-26 06:19:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:19:38] [INFO ] [Nat]Absence check using 1100 positive place invariants in 205 ms returned sat
[2023-03-26 06:19:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:19:39] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2023-03-26 06:19:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2023-03-26 06:19:39] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-26 06:19:59] [INFO ] Added : 580 causal constraints over 116 iterations in 20267 ms.(timeout) Result :sat
Minimization took 289 ms.
[2023-03-26 06:20:00] [INFO ] [Real]Absence check using 1100 positive place invariants in 203 ms returned sat
[2023-03-26 06:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:20:01] [INFO ] [Real]Absence check using state equation in 1109 ms returned sat
[2023-03-26 06:20:02] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-26 06:20:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:20:02] [INFO ] [Nat]Absence check using 1100 positive place invariants in 202 ms returned sat
[2023-03-26 06:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:20:03] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2023-03-26 06:20:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-26 06:20:03] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 2 ms to minimize.
[2023-03-26 06:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2023-03-26 06:20:04] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 103 ms.
[2023-03-26 06:20:24] [INFO ] Added : 585 causal constraints over 117 iterations in 20145 ms.(timeout) Result :sat
Minimization took 283 ms.
[2023-03-26 06:20:24] [INFO ] [Real]Absence check using 1100 positive place invariants in 208 ms returned sat
[2023-03-26 06:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:20:26] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2023-03-26 06:20:26] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-26 06:20:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:20:26] [INFO ] [Nat]Absence check using 1100 positive place invariants in 271 ms returned sat
[2023-03-26 06:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:20:27] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2023-03-26 06:20:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-26 06:20:28] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-26 06:20:28] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-26 06:20:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
[2023-03-26 06:20:28] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 92 ms.
[2023-03-26 06:20:48] [INFO ] Added : 615 causal constraints over 123 iterations in 20032 ms.(timeout) Result :sat
Minimization took 310 ms.
[2023-03-26 06:20:49] [INFO ] [Real]Absence check using 1100 positive place invariants in 235 ms returned sat
[2023-03-26 06:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-26 06:20:50] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2023-03-26 06:20:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-26 06:20:51] [INFO ] [Nat]Absence check using 1100 positive place invariants in 234 ms returned sat
[2023-03-26 06:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-26 06:20:52] [INFO ] [Nat]Absence check using state equation in 1155 ms returned sat
[2023-03-26 06:20:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-26 06:20:52] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 132 ms.
[2023-03-26 06:21:12] [INFO ] Added : 620 causal constraints over 124 iterations in 20131 ms.(timeout) Result :sat
Minimization took 289 ms.
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]
FORMULA ShieldPPPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 318563 ms.

BK_STOP 1679811680034

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is ShieldPPPt-PT-100B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r415-oct2-167903730600088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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