About the Execution of 2023-gold for LeafsetExtension-PT-S32C3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
608.623 | 47685.00 | 62640.00 | 374.80 | 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628400231.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 LeafsetExtension-PT-S32C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400231
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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 LeafsetExtension-PT-S32C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716563587052
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=LeafsetExtension-PT-S32C3
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 15:13:08] [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-24 15:13:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:13:08] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-24 15:13:08] [INFO ] Transformed 5622 places.
[2024-05-24 15:13:09] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:13:09] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 15:13:09] [INFO ] Computed 173 invariants in 384 ms
Incomplete random walk after 10000 steps, including 384 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 16) seen :12
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :2
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
[2024-05-24 15:13:09] [INFO ] Invariant cache hit.
[2024-05-24 15:13:10] [INFO ] [Real]Absence check using 35 positive place invariants in 76 ms returned sat
[2024-05-24 15:13:10] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 154 ms returned sat
[2024-05-24 15:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:13:13] [INFO ] [Real]Absence check using state equation in 3255 ms returned sat
[2024-05-24 15:13:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:13:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 65 ms returned sat
[2024-05-24 15:13:14] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 144 ms returned sat
[2024-05-24 15:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:13:18] [INFO ] [Nat]Absence check using state equation in 3413 ms returned sat
[2024-05-24 15:13:18] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 328 ms.
[2024-05-24 15:13:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
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-24 15:13:19] [INFO ] [Real]Absence check using 35 positive place invariants in 57 ms returned sat
[2024-05-24 15:13:19] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 161 ms returned sat
[2024-05-24 15:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:13:23] [INFO ] [Real]Absence check using state equation in 3143 ms returned sat
[2024-05-24 15:13:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:13:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 67 ms returned sat
[2024-05-24 15:13:23] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 139 ms returned sat
[2024-05-24 15:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:13:27] [INFO ] [Nat]Absence check using state equation in 3278 ms returned sat
[2024-05-24 15:13:27] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 233 ms.
[2024-05-24 15:13:35] [INFO ] Deduced a trap composed of 2 places in 7153 ms of which 13 ms to minimize.
[2024-05-24 15:13:35] [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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
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-24 15:13:36] [INFO ] [Real]Absence check using 35 positive place invariants in 68 ms returned sat
[2024-05-24 15:13:36] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 135 ms returned sat
[2024-05-24 15:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:13:39] [INFO ] [Real]Absence check using state equation in 3244 ms returned sat
[2024-05-24 15:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:13:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned sat
[2024-05-24 15:13:40] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 148 ms returned sat
[2024-05-24 15:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:13:43] [INFO ] [Nat]Absence check using state equation in 3613 ms returned sat
[2024-05-24 15:13:44] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 246 ms.
[2024-05-24 15:13:51] [INFO ] Deduced a trap composed of 2 places in 6759 ms of which 6 ms to minimize.
[2024-05-24 15:13:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
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-24 15:13:51] [INFO ] [Real]Absence check using 35 positive place invariants in 56 ms returned sat
[2024-05-24 15:13:52] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 51 ms returned unsat
[2024-05-24 15:13:52] [INFO ] [Real]Absence check using 35 positive place invariants in 56 ms returned sat
[2024-05-24 15:13:52] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 95 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1] Max seen :[1, 0, 0, 1, 1]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 91 are kept as prefixes of interest. Removing 5531 places using SCC suffix rule.13 ms
Discarding 5531 places :
Also discarding 4035 output transitions
Drop transitions removed 4035 transitions
Drop transitions removed 1088 transitions
Reduce isomorphic transitions removed 1088 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 1118 rules applied. Total rules applied 1119 place count 77 transition count 310
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 48 rules applied. Total rules applied 1167 place count 58 transition count 281
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1181 place count 44 transition count 281
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1184 place count 44 transition count 278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1187 place count 41 transition count 278
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 1202 place count 41 transition count 263
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1217 place count 26 transition count 263
Drop transitions removed 210 transitions
Redundant transition composition rules discarded 210 transitions
Iterating global reduction 5 with 210 rules applied. Total rules applied 1427 place count 26 transition count 53
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1436 place count 17 transition count 26
Iterating global reduction 5 with 9 rules applied. Total rules applied 1445 place count 17 transition count 26
Applied a total of 1445 rules in 81 ms. Remains 17 /5622 variables (removed 5605) and now considering 26/5449 (removed 5423) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 17/5622 places, 26/5449 transitions.
Normalized transition count is 17 out of 26 initially.
// Phase 1: matrix 17 rows 17 cols
[2024-05-24 15:13:52] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 112862 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 3) seen :5
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 34183 resets, run finished after 341 ms. (steps per millisecond=2932 ) properties (out of 1) seen :3
[2024-05-24 15:13:53] [INFO ] Flow matrix only has 17 transitions (discarded 9 similar events)
// Phase 1: matrix 17 rows 17 cols
[2024-05-24 15:13:53] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 15:13:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-24 15:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:13:53] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [3] Max seen :[3]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 45195 ms.
BK_STOP 1716563634737
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="LeafsetExtension-PT-S32C3"
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 LeafsetExtension-PT-S32C3, 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 r241-tall-171649628400231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C3.tgz
mv LeafsetExtension-PT-S32C3 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 '
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 ;