Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788800216.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r373-tall-171683788800216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 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 1716958854820

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-29 05:00:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 05:00:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:00:57] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2024-05-29 05:00:57] [INFO ] Transformed 7003 places.
[2024-05-29 05:00:57] [INFO ] Transformed 6503 transitions.
[2024-05-29 05:00:57] [INFO ] Found NUPN structural information;
[2024-05-29 05:00:57] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 758 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 6503 rows 7003 cols
[2024-05-29 05:00:57] [INFO ] Computed 901 invariants in 77 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 16) seen :11
FORMULA ShieldIIPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) 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 5) seen :0
[2024-05-29 05:00:58] [INFO ] Invariant cache hit.
[2024-05-29 05:01:00] [INFO ] [Real]Absence check using 901 positive place invariants in 689 ms returned sat
[2024-05-29 05:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:01:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-29 05:01:04] [INFO ] [Real]Absence check using 901 positive place invariants in 643 ms returned sat
[2024-05-29 05:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:01:08] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-29 05:01:10] [INFO ] [Real]Absence check using 901 positive place invariants in 633 ms returned sat
[2024-05-29 05:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:01:13] [INFO ] [Real]Absence check using state equation in 3421 ms returned unknown
[2024-05-29 05:01:15] [INFO ] [Real]Absence check using 901 positive place invariants in 631 ms returned sat
[2024-05-29 05:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:01:18] [INFO ] [Real]Absence check using state equation in 3257 ms returned unknown
[2024-05-29 05:01:20] [INFO ] [Real]Absence check using 901 positive place invariants in 579 ms returned sat
[2024-05-29 05:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:01:23] [INFO ] [Real]Absence check using state equation in 3354 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1701 transitions
Trivial Post-agglo rules discarded 1701 transitions
Performed 1701 trivial Post agglomeration. Transition count delta: 1701
Iterating post reduction 0 with 1701 rules applied. Total rules applied 1701 place count 7003 transition count 4802
Reduce places removed 1701 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 1703 rules applied. Total rules applied 3404 place count 5302 transition count 4800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3405 place count 5301 transition count 4800
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3405 place count 5301 transition count 4400
Deduced a syphon composed of 400 places in 28 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 4205 place count 4901 transition count 4400
Discarding 698 places :
Symmetric choice reduction at 3 with 698 rule applications. Total rules 4903 place count 4203 transition count 3702
Iterating global reduction 3 with 698 rules applied. Total rules applied 5601 place count 4203 transition count 3702
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 297 Pre rules applied. Total rules applied 5601 place count 4203 transition count 3405
Deduced a syphon composed of 297 places in 15 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 3 with 594 rules applied. Total rules applied 6195 place count 3906 transition count 3405
Performed 1702 Post agglomeration using F-continuation condition.Transition count delta: 1702
Deduced a syphon composed of 1702 places in 5 ms
Reduce places removed 1702 places and 0 transitions.
Iterating global reduction 3 with 3404 rules applied. Total rules applied 9599 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9801 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 10003 place count 2002 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 13 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 10195 place count 1906 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10196 place count 1906 transition count 1898
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 10296 place count 1906 transition count 1898
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10297 place count 1905 transition count 1897
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 10299 place count 1903 transition count 1897
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 10299 place count 1903 transition count 1896
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 10301 place count 1902 transition count 1896
Applied a total of 10301 rules in 2425 ms. Remains 1902 /7003 variables (removed 5101) and now considering 1896/6503 (removed 4607) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2426 ms. Remains : 1902/7003 places, 1896/6503 transitions.
// Phase 1: matrix 1896 rows 1902 cols
[2024-05-29 05:01:25] [INFO ] Computed 899 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14975 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 474070 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 473791 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 471839 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 476942 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 476046 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
[2024-05-29 05:02:05] [INFO ] Invariant cache hit.
[2024-05-29 05:02:06] [INFO ] [Real]Absence check using 899 positive place invariants in 168 ms returned sat
[2024-05-29 05:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:02:07] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2024-05-29 05:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 05:02:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-29 05:02:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:02:07] [INFO ] [Nat]Absence check using 899 positive place invariants in 167 ms returned sat
[2024-05-29 05:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:02:08] [INFO ] [Nat]Absence check using state equation in 782 ms returned sat
[2024-05-29 05:02:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-29 05:02:08] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 164 ms.
[2024-05-29 05:02:28] [INFO ] Added : 930 causal constraints over 186 iterations in 20133 ms.(timeout) Result :sat
Minimization took 456 ms.
[2024-05-29 05:02:29] [INFO ] [Real]Absence check using 899 positive place invariants in 179 ms returned sat
[2024-05-29 05:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:02:30] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-05-29 05:02:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:02:30] [INFO ] [Nat]Absence check using 899 positive place invariants in 163 ms returned sat
[2024-05-29 05:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:02:31] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2024-05-29 05:02:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-29 05:02:31] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 104 ms.
[2024-05-29 05:02:51] [INFO ] Added : 945 causal constraints over 189 iterations in 20075 ms.(timeout) Result :sat
Minimization took 408 ms.
[2024-05-29 05:02:52] [INFO ] [Real]Absence check using 899 positive place invariants in 176 ms returned sat
[2024-05-29 05:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:02:53] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2024-05-29 05:02:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:02:53] [INFO ] [Nat]Absence check using 899 positive place invariants in 165 ms returned sat
[2024-05-29 05:02:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:02:54] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2024-05-29 05:02:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-29 05:02:54] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 115 ms.
[2024-05-29 05:03:14] [INFO ] Added : 945 causal constraints over 189 iterations in 20262 ms.(timeout) Result :sat
Minimization took 421 ms.
[2024-05-29 05:03:15] [INFO ] [Real]Absence check using 899 positive place invariants in 163 ms returned sat
[2024-05-29 05:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:03:16] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2024-05-29 05:03:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:03:16] [INFO ] [Nat]Absence check using 899 positive place invariants in 167 ms returned sat
[2024-05-29 05:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:03:17] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2024-05-29 05:03:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-29 05:03:17] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 106 ms.
[2024-05-29 05:03:37] [INFO ] Added : 950 causal constraints over 190 iterations in 20036 ms.(timeout) Result :sat
Minimization took 495 ms.
[2024-05-29 05:03:38] [INFO ] [Real]Absence check using 899 positive place invariants in 163 ms returned sat
[2024-05-29 05:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:03:39] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2024-05-29 05:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:03:39] [INFO ] [Nat]Absence check using 899 positive place invariants in 174 ms returned sat
[2024-05-29 05:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:03:40] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2024-05-29 05:03:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-29 05:03:40] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 109 ms.
[2024-05-29 05:04:00] [INFO ] Added : 950 causal constraints over 190 iterations in 20131 ms.(timeout) Result :sat
Minimization took 468 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 188096 ms.

BK_STOP 1716959045911

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r373-tall-171683788800216"
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 ;