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-165286037400262.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-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037400262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.9M 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-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 1653033135977

Running Version 0
[2022-05-20 07:52:17] [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:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:52:17] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2022-05-20 07:52:18] [INFO ] Transformed 7803 places.
[2022-05-20 07:52:18] [INFO ] Transformed 7103 transitions.
[2022-05-20 07:52:18] [INFO ] Found NUPN structural information;
[2022-05-20 07:52:18] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 617 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 7103 rows 7803 cols
[2022-05-20 07:52:18] [INFO ] Computed 1101 place invariants in 82 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 16) seen :10
FORMULA ShieldPPPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
// Phase 1: matrix 7103 rows 7803 cols
[2022-05-20 07:52:19] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 07:52:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 860 ms returned sat
[2022-05-20 07:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:24] [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 0
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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:52:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 803 ms returned sat
[2022-05-20 07:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:29] [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.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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:52:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 806 ms returned sat
[2022-05-20 07:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:34] [INFO ] [Real]Absence check using state equation in 3030 ms returned unknown
[2022-05-20 07:52:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 802 ms returned sat
[2022-05-20 07:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:39] [INFO ] [Real]Absence check using state equation in 3058 ms returned unknown
[2022-05-20 07:52:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 793 ms returned sat
[2022-05-20 07:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:44] [INFO ] [Real]Absence check using state equation in 3220 ms returned unknown
[2022-05-20 07:52:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 788 ms returned sat
[2022-05-20 07:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:49] [INFO ] [Real]Absence check using state equation in 3081 ms returned sat
[2022-05-20 07:52:59] [INFO ] Deduced a trap composed of 17 places in 9805 ms of which 29 ms to minimize.
[2022-05-20 07:52: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: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:2242)
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] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 7803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1901 transitions
Trivial Post-agglo rules discarded 1901 transitions
Performed 1901 trivial Post agglomeration. Transition count delta: 1901
Iterating post reduction 0 with 1901 rules applied. Total rules applied 1901 place count 7803 transition count 5202
Reduce places removed 1901 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 1903 rules applied. Total rules applied 3804 place count 5902 transition count 5200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3805 place count 5901 transition count 5200
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3805 place count 5901 transition count 4800
Deduced a syphon composed of 400 places in 67 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 4605 place count 5501 transition count 4800
Discarding 699 places :
Symmetric choice reduction at 3 with 699 rule applications. Total rules 5304 place count 4802 transition count 4101
Iterating global reduction 3 with 699 rules applied. Total rules applied 6003 place count 4802 transition count 4101
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 299 Pre rules applied. Total rules applied 6003 place count 4802 transition count 3802
Deduced a syphon composed of 299 places in 21 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 3 with 598 rules applied. Total rules applied 6601 place count 4503 transition count 3802
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 10 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 9995 place count 2806 transition count 2105
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 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10197 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10399 place count 2604 transition count 2105
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 46 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 10591 place count 2508 transition count 2105
Partial Free-agglomeration rule applied 300 times.
Drop transitions removed 300 transitions
Iterating global reduction 3 with 300 rules applied. Total rules applied 10891 place count 2508 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10892 place count 2507 transition count 2104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10893 place count 2506 transition count 2104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 10893 place count 2506 transition count 2102
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 10897 place count 2504 transition count 2102
Applied a total of 10897 rules in 3288 ms. Remains 2504 /7803 variables (removed 5299) and now considering 2102/7103 (removed 5001) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/7803 places, 2102/7103 transitions.
// Phase 1: matrix 2102 rows 2504 cols
[2022-05-20 07:53:02] [INFO ] Computed 1100 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 13061 ms. (steps per millisecond=76 ) properties (out of 6) seen :2
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 477308 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :{}
Interrupted Best-First random walk after 474668 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :{}
Interrupted Best-First random walk after 486512 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :{}
Interrupted Best-First random walk after 517002 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :{}
// Phase 1: matrix 2102 rows 2504 cols
[2022-05-20 07:53:35] [INFO ] Computed 1100 place invariants in 11 ms
[2022-05-20 07:53:35] [INFO ] [Real]Absence check using 1100 positive place invariants in 239 ms returned sat
[2022-05-20 07:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:53:36] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2022-05-20 07:53:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:53:37] [INFO ] [Nat]Absence check using 1100 positive place invariants in 219 ms returned sat
[2022-05-20 07:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:53:38] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2022-05-20 07:53:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 07:53:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-20 07:53:38] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 2 ms to minimize.
[2022-05-20 07:53:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2022-05-20 07:53:38] [INFO ] Computed and/alt/rep : 2098/4974/2098 causal constraints (skipped 0 transitions) in 91 ms.
[2022-05-20 07:53:58] [INFO ] Added : 815 causal constraints over 163 iterations in 20051 ms.(timeout) Result :sat
Minimization took 477 ms.
[2022-05-20 07:53:59] [INFO ] [Real]Absence check using 1100 positive place invariants in 208 ms returned sat
[2022-05-20 07:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:54:00] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2022-05-20 07:54:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:54:01] [INFO ] [Nat]Absence check using 1100 positive place invariants in 210 ms returned sat
[2022-05-20 07:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:54:02] [INFO ] [Nat]Absence check using state equation in 965 ms returned sat
[2022-05-20 07:54:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-20 07:54:02] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 2 ms to minimize.
[2022-05-20 07:54:02] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 3 ms to minimize.
[2022-05-20 07:54:03] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2022-05-20 07:54:03] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2022-05-20 07:54:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1413 ms
[2022-05-20 07:54:03] [INFO ] Computed and/alt/rep : 2098/4974/2098 causal constraints (skipped 0 transitions) in 103 ms.
[2022-05-20 07:54:24] [INFO ] Added : 800 causal constraints over 160 iterations in 20272 ms.(timeout) Result :sat
Minimization took 491 ms.
[2022-05-20 07:54:25] [INFO ] [Real]Absence check using 1100 positive place invariants in 198 ms returned sat
[2022-05-20 07:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:54:25] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2022-05-20 07:54:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:54:26] [INFO ] [Nat]Absence check using 1100 positive place invariants in 209 ms returned sat
[2022-05-20 07:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:54:27] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2022-05-20 07:54:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:54:27] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 5 ms to minimize.
[2022-05-20 07:54:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2022-05-20 07:54:27] [INFO ] Computed and/alt/rep : 2098/4974/2098 causal constraints (skipped 0 transitions) in 99 ms.
[2022-05-20 07:54:47] [INFO ] Added : 815 causal constraints over 163 iterations in 20079 ms.(timeout) Result :sat
Minimization took 551 ms.
[2022-05-20 07:54:48] [INFO ] [Real]Absence check using 1100 positive place invariants in 195 ms returned sat
[2022-05-20 07:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:54:49] [INFO ] [Real]Absence check using state equation in 905 ms returned sat
[2022-05-20 07:54:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:54:50] [INFO ] [Nat]Absence check using 1100 positive place invariants in 199 ms returned sat
[2022-05-20 07:54:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:54:51] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2022-05-20 07:54:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:54:51] [INFO ] Computed and/alt/rep : 2098/4974/2098 causal constraints (skipped 0 transitions) in 103 ms.
[2022-05-20 07:55:11] [INFO ] Added : 810 causal constraints over 162 iterations in 20261 ms.(timeout) Result :sat
Minimization took 491 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 150200 steps, including 1000 resets, run finished after 2082 ms. (steps per millisecond=72 ) properties (out of 4) seen :4 could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653033315295

--------------------
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-100B"
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-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 r233-tall-165286037400262"
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 ;