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-165286037100130.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 ShieldIIPt-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-165286037100130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.5K Apr 29 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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.7M 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 ShieldIIPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653032536002

Running Version 0
[2022-05-20 07:42: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:42:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:42:17] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2022-05-20 07:42:18] [INFO ] Transformed 7003 places.
[2022-05-20 07:42:18] [INFO ] Transformed 6503 transitions.
[2022-05-20 07:42:18] [INFO ] Found NUPN structural information;
[2022-05-20 07:42:18] [INFO ] Parsed PT model containing 7003 places and 6503 transitions in 573 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 6503 rows 7003 cols
[2022-05-20 07:42:18] [INFO ] Computed 901 place invariants in 70 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 16) seen :7
FORMULA ShieldIIPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 18 ms. (steps per millisecond=555 ) properties (out of 9) 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 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 16 ms. (steps per millisecond=625 ) 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 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
// Phase 1: matrix 6503 rows 7003 cols
[2022-05-20 07:42:18] [INFO ] Computed 901 place invariants in 31 ms
[2022-05-20 07:42:20] [INFO ] [Real]Absence check using 901 positive place invariants in 673 ms returned sat
[2022-05-20 07:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:24] [INFO ] [Real]Absence check using state equation in 3292 ms returned unknown
[2022-05-20 07:42:25] [INFO ] [Real]Absence check using 901 positive place invariants in 608 ms returned sat
[2022-05-20 07:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:29] [INFO ] [Real]Absence check using state equation in 3538 ms returned unknown
[2022-05-20 07:42:30] [INFO ] [Real]Absence check using 901 positive place invariants in 627 ms returned sat
[2022-05-20 07:42:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:34] [INFO ] [Real]Absence check using state equation in 3473 ms returned unknown
[2022-05-20 07:42:35] [INFO ] [Real]Absence check using 901 positive place invariants in 631 ms returned sat
[2022-05-20 07:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:39] [INFO ] [Real]Absence check using state equation in 3496 ms returned unknown
[2022-05-20 07:42:40] [INFO ] [Real]Absence check using 901 positive place invariants in 607 ms returned sat
[2022-05-20 07:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:44] [INFO ] [Real]Absence check using state equation in 3542 ms returned unknown
[2022-05-20 07:42:45] [INFO ] [Real]Absence check using 901 positive place invariants in 611 ms returned sat
[2022-05-20 07:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:49] [INFO ] [Real]Absence check using state equation in 3544 ms returned unknown
[2022-05-20 07:42:50] [INFO ] [Real]Absence check using 901 positive place invariants in 607 ms returned sat
[2022-05-20 07:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:54] [INFO ] [Real]Absence check using state equation in 3523 ms returned sat
[2022-05-20 07:43:02] [INFO ] Deduced a trap composed of 13 places in 7974 ms of which 20 ms to minimize.
[2022-05-20 07:43:02] [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: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:43:03] [INFO ] [Real]Absence check using 901 positive place invariants in 613 ms returned sat
[2022-05-20 07:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:07] [INFO ] [Real]Absence check using state equation in 3420 ms returned unknown
[2022-05-20 07:43:08] [INFO ] [Real]Absence check using 901 positive place invariants in 601 ms returned sat
[2022-05-20 07:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:12] [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 8
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)
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 7003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1698 transitions
Trivial Post-agglo rules discarded 1698 transitions
Performed 1698 trivial Post agglomeration. Transition count delta: 1698
Iterating post reduction 0 with 1698 rules applied. Total rules applied 1698 place count 7003 transition count 4805
Reduce places removed 1698 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 1700 rules applied. Total rules applied 3398 place count 5305 transition count 4803
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3399 place count 5304 transition count 4803
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3399 place count 5304 transition count 4403
Deduced a syphon composed of 400 places in 65 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 4199 place count 4904 transition count 4403
Discarding 697 places :
Symmetric choice reduction at 3 with 697 rule applications. Total rules 4896 place count 4207 transition count 3706
Iterating global reduction 3 with 697 rules applied. Total rules applied 5593 place count 4207 transition count 3706
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 298 Pre rules applied. Total rules applied 5593 place count 4207 transition count 3408
Deduced a syphon composed of 298 places in 45 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 596 rules applied. Total rules applied 6189 place count 3909 transition count 3408
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 3 with 3400 rules applied. Total rules applied 9589 place count 2209 transition count 1708
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9791 place count 2108 transition count 1775
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9993 place count 2007 transition count 1839
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 94 places in 15 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 10181 place count 1913 transition count 1902
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10182 place count 1913 transition count 1901
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10183 place count 1913 transition count 1900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10184 place count 1912 transition count 1900
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 5 with 99 rules applied. Total rules applied 10283 place count 1912 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10284 place count 1911 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 10286 place count 1909 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 10286 place count 1909 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 10288 place count 1908 transition count 1898
Applied a total of 10288 rules in 2759 ms. Remains 1908 /7003 variables (removed 5095) and now considering 1898/6503 (removed 4605) transitions.
Finished structural reductions, in 1 iterations. Remains : 1908/7003 places, 1898/6503 transitions.
// Phase 1: matrix 1898 rows 1908 cols
[2022-05-20 07:43:15] [INFO ] Computed 899 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15145 ms. (steps per millisecond=66 ) properties (out of 9) seen :2
FORMULA ShieldIIPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 434065 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :{}
Interrupted Best-First random walk after 430900 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :{}
Interrupted Best-First random walk after 439312 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen :{}
Interrupted Best-First random walk after 436688 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen :{}
Interrupted Best-First random walk after 435056 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :{}
Interrupted Best-First random walk after 438751 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen :{}
Interrupted Best-First random walk after 436362 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen :{}
// Phase 1: matrix 1898 rows 1908 cols
[2022-05-20 07:44:05] [INFO ] Computed 899 place invariants in 11 ms
[2022-05-20 07:44:05] [INFO ] [Real]Absence check using 899 positive place invariants in 162 ms returned sat
[2022-05-20 07:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:06] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2022-05-20 07:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:44:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:06] [INFO ] [Nat]Absence check using 899 positive place invariants in 148 ms returned sat
[2022-05-20 07:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:07] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2022-05-20 07:44:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:07] [INFO ] Computed and/alt/rep : 1895/3380/1895 causal constraints (skipped 0 transitions) in 147 ms.
[2022-05-20 07:44:27] [INFO ] Added : 910 causal constraints over 182 iterations in 20127 ms.(timeout) Result :sat
Minimization took 488 ms.
[2022-05-20 07:44:28] [INFO ] [Real]Absence check using 899 positive place invariants in 145 ms returned sat
[2022-05-20 07:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:29] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2022-05-20 07:44:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:29] [INFO ] [Nat]Absence check using 899 positive place invariants in 147 ms returned sat
[2022-05-20 07:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:30] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2022-05-20 07:44:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:30] [INFO ] Computed and/alt/rep : 1895/3380/1895 causal constraints (skipped 0 transitions) in 84 ms.
[2022-05-20 07:44:50] [INFO ] Added : 910 causal constraints over 182 iterations in 20070 ms.(timeout) Result :sat
Minimization took 419 ms.
[2022-05-20 07:44:51] [INFO ] [Real]Absence check using 899 positive place invariants in 137 ms returned sat
[2022-05-20 07:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:51] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2022-05-20 07:44:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:52] [INFO ] [Nat]Absence check using 899 positive place invariants in 141 ms returned sat
[2022-05-20 07:44:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:52] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2022-05-20 07:44:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:53] [INFO ] Computed and/alt/rep : 1895/3380/1895 causal constraints (skipped 0 transitions) in 87 ms.
[2022-05-20 07:45:13] [INFO ] Added : 920 causal constraints over 184 iterations in 20229 ms.(timeout) Result :sat
Minimization took 515 ms.
[2022-05-20 07:45:14] [INFO ] [Real]Absence check using 899 positive place invariants in 153 ms returned sat
[2022-05-20 07:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:14] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2022-05-20 07:45:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:15] [INFO ] [Nat]Absence check using 899 positive place invariants in 143 ms returned sat
[2022-05-20 07:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:15] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2022-05-20 07:45:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:45:15] [INFO ] Computed and/alt/rep : 1895/3380/1895 causal constraints (skipped 0 transitions) in 77 ms.
[2022-05-20 07:45:35] [INFO ] Added : 910 causal constraints over 182 iterations in 20084 ms.(timeout) Result :sat
Minimization took 463 ms.
[2022-05-20 07:45:36] [INFO ] [Real]Absence check using 899 positive place invariants in 142 ms returned sat
[2022-05-20 07:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:37] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2022-05-20 07:45:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:37] [INFO ] [Nat]Absence check using 899 positive place invariants in 144 ms returned sat
[2022-05-20 07:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:38] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2022-05-20 07:45:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:45:38] [INFO ] Computed and/alt/rep : 1895/3380/1895 causal constraints (skipped 0 transitions) in 77 ms.
[2022-05-20 07:45:58] [INFO ] Added : 905 causal constraints over 181 iterations in 20072 ms.(timeout) Result :sat
Minimization took 466 ms.
[2022-05-20 07:45:59] [INFO ] [Real]Absence check using 899 positive place invariants in 141 ms returned sat
[2022-05-20 07:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:00] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2022-05-20 07:46:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:46:00] [INFO ] [Nat]Absence check using 899 positive place invariants in 140 ms returned sat
[2022-05-20 07:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:01] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2022-05-20 07:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:46:01] [INFO ] Computed and/alt/rep : 1895/3380/1895 causal constraints (skipped 0 transitions) in 78 ms.
[2022-05-20 07:46:21] [INFO ] Added : 920 causal constraints over 184 iterations in 20284 ms.(timeout) Result :sat
Minimization took 498 ms.
[2022-05-20 07:46:22] [INFO ] [Real]Absence check using 899 positive place invariants in 144 ms returned sat
[2022-05-20 07:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:23] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2022-05-20 07:46:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:46:23] [INFO ] [Nat]Absence check using 899 positive place invariants in 142 ms returned sat
[2022-05-20 07:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:24] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2022-05-20 07:46:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:46:24] [INFO ] Computed and/alt/rep : 1895/3380/1895 causal constraints (skipped 0 transitions) in 80 ms.
[2022-05-20 07:46:44] [INFO ] Added : 905 causal constraints over 181 iterations in 20155 ms.(timeout) Result :sat
Minimization took 470 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 222900 steps, including 1001 resets, run finished after 3472 ms. (steps per millisecond=64 ) properties (out of 7) seen :6 could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 224000 steps, including 1001 resets, run finished after 3362 ms. (steps per millisecond=66 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653032812683

--------------------
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="ShieldIIPt-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 ShieldIIPt-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-165286037100130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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