About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S24C08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16222.896 | 3600000.00 | 2837718.00 | 388301.80 | 1 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.r263-tall-171654372000066.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 MultiCrashLeafsetExtension-PT-S24C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 12 06:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 06:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M 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 MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716641423316
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=MultiCrashLeafsetExtension-PT-S24C08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 12:50:24] [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-25 12:50:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:50:25] [INFO ] Load time of PNML (sax parser for PT used): 508 ms
[2024-05-25 12:50:25] [INFO ] Transformed 15180 places.
[2024-05-25 12:50:25] [INFO ] Transformed 22267 transitions.
[2024-05-25 12:50:25] [INFO ] Parsed PT model containing 15180 places and 22267 transitions and 84086 arcs in 657 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 21667 out of 22267 initially.
// Phase 1: matrix 21667 rows 15180 cols
[2024-05-25 12:50:27] [INFO ] Computed 1137 invariants in 1613 ms
Incomplete random walk after 10000 steps, including 121 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :2
[2024-05-25 12:50:28] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15180 cols
[2024-05-25 12:50:30] [INFO ] Computed 1137 invariants in 1559 ms
[2024-05-25 12:50:32] [INFO ] [Real]Absence check using 70 positive place invariants in 319 ms returned sat
[2024-05-25 12:50:32] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 739 ms returned sat
[2024-05-25 12:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:50: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 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-25 12:50:37] [INFO ] [Real]Absence check using 70 positive place invariants in 304 ms returned sat
[2024-05-25 12:50:37] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 462 ms returned unsat
[2024-05-25 12:50:39] [INFO ] [Real]Absence check using 70 positive place invariants in 309 ms returned sat
[2024-05-25 12:50:39] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 642 ms returned sat
[2024-05-25 12:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:50:42] [INFO ] [Real]Absence check using state equation in 2670 ms returned unknown
[2024-05-25 12:50:44] [INFO ] [Real]Absence check using 70 positive place invariants in 319 ms returned sat
[2024-05-25 12:50:44] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 490 ms returned unsat
[2024-05-25 12:50:46] [INFO ] [Real]Absence check using 70 positive place invariants in 291 ms returned sat
[2024-05-25 12:50:46] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 451 ms returned unsat
[2024-05-25 12:50:48] [INFO ] [Real]Absence check using 70 positive place invariants in 302 ms returned sat
[2024-05-25 12:50:49] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 784 ms returned sat
[2024-05-25 12:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:50:51] [INFO ] [Real]Absence check using state equation in 2327 ms returned unknown
[2024-05-25 12:50:53] [INFO ] [Real]Absence check using 70 positive place invariants in 310 ms returned sat
[2024-05-25 12:50:54] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 787 ms returned sat
[2024-05-25 12:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:50:56] [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: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-25 12:50:58] [INFO ] [Real]Absence check using 70 positive place invariants in 299 ms returned sat
[2024-05-25 12:50:59] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 736 ms returned sat
[2024-05-25 12:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:51:01] [INFO ] [Real]Absence check using state equation in 2612 ms returned unknown
[2024-05-25 12:51:03] [INFO ] [Real]Absence check using 70 positive place invariants in 293 ms returned sat
[2024-05-25 12:51:04] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 689 ms returned sat
[2024-05-25 12:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:51:06] [INFO ] [Real]Absence check using state equation in 2676 ms returned unknown
[2024-05-25 12:51:08] [INFO ] [Real]Absence check using 70 positive place invariants in 294 ms returned sat
[2024-05-25 12:51:09] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 454 ms returned unsat
[2024-05-25 12:51:10] [INFO ] [Real]Absence check using 70 positive place invariants in 295 ms returned sat
[2024-05-25 12:51:11] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 411 ms returned unsat
[2024-05-25 12:51:12] [INFO ] [Real]Absence check using 70 positive place invariants in 298 ms returned sat
[2024-05-25 12:51:13] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 705 ms returned sat
[2024-05-25 12:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:51:16] [INFO ] [Real]Absence check using state equation in 2460 ms returned unknown
[2024-05-25 12:51:17] [INFO ] [Real]Absence check using 70 positive place invariants in 296 ms returned sat
[2024-05-25 12:51:18] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 464 ms returned unsat
[2024-05-25 12:51:20] [INFO ] [Real]Absence check using 70 positive place invariants in 311 ms returned sat
[2024-05-25 12:51:20] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 474 ms returned unsat
[2024-05-25 12:51:22] [INFO ] [Real]Absence check using 70 positive place invariants in 293 ms returned sat
[2024-05-25 12:51:22] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 458 ms returned unsat
[2024-05-25 12:51:24] [INFO ] [Real]Absence check using 70 positive place invariants in 323 ms returned sat
[2024-05-25 12:51:25] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 735 ms returned sat
[2024-05-25 12:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:51:27] [INFO ] [Real]Absence check using state equation in 2434 ms returned unknown
Current structural bounds on expressions (after SMT) : [25, 1, 75, 1, 1, 25, 25, 75, 75, 1, 1, 75, 1, 1, 1, 75] Max seen :[0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 15180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Graph (complete) has 49169 edges and 15180 vertex of which 15136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.43 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions removed 4792 transitions
Trivial Post-agglo rules discarded 4792 transitions
Performed 4792 trivial Post agglomeration. Transition count delta: 4792
Iterating post reduction 0 with 4792 rules applied. Total rules applied 4793 place count 15136 transition count 17475
Reduce places removed 4792 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 4797 rules applied. Total rules applied 9590 place count 10344 transition count 17470
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 9595 place count 10339 transition count 17470
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 9595 place count 10339 transition count 17070
Deduced a syphon composed of 400 places in 19 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 10395 place count 9939 transition count 17070
Discarding 4392 places :
Symmetric choice reduction at 3 with 4392 rule applications. Total rules 14787 place count 5547 transition count 12678
Iterating global reduction 3 with 4392 rules applied. Total rules applied 19179 place count 5547 transition count 12678
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 19179 place count 5547 transition count 12667
Deduced a syphon composed of 11 places in 24 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 19201 place count 5536 transition count 12667
Discarding 542 places :
Symmetric choice reduction at 3 with 542 rule applications. Total rules 19743 place count 4994 transition count 8331
Iterating global reduction 3 with 542 rules applied. Total rules applied 20285 place count 4994 transition count 8331
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20335 place count 4969 transition count 8306
Free-agglomeration rule (complex) applied 344 times.
Iterating global reduction 3 with 344 rules applied. Total rules applied 20679 place count 4969 transition count 11756
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 3 with 344 rules applied. Total rules applied 21023 place count 4625 transition count 11756
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 4 with 125 rules applied. Total rules applied 21148 place count 4625 transition count 11756
Applied a total of 21148 rules in 5313 ms. Remains 4625 /15180 variables (removed 10555) and now considering 11756/22267 (removed 10511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5315 ms. Remains : 4625/15180 places, 11756/22267 transitions.
Normalized transition count is 10870 out of 11756 initially.
// Phase 1: matrix 10870 rows 4625 cols
[2024-05-25 12:51:33] [INFO ] Computed 1093 invariants in 306 ms
Interrupted random walk after 705725 steps, including 14271 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 5
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 798920 steps, including 2072 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 1
Interrupted Best-First random walk after 794062 steps, including 2060 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen 2
Interrupted Best-First random walk after 793339 steps, including 2058 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen 1
Interrupted Best-First random walk after 797820 steps, including 2069 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 1
Interrupted Best-First random walk after 798085 steps, including 2070 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 1
[2024-05-25 12:52:28] [INFO ] Flow matrix only has 10870 transitions (discarded 886 similar events)
// Phase 1: matrix 10870 rows 4625 cols
[2024-05-25 12:52:28] [INFO ] Computed 1093 invariants in 277 ms
[2024-05-25 12:52:29] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 12:52:29] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 77 ms returned unsat
[2024-05-25 12:52:29] [INFO ] [Real]Absence check using 49 positive place invariants in 90 ms returned sat
[2024-05-25 12:52:29] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 15 ms returned unsat
[2024-05-25 12:52:30] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 12:52:30] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 255 ms returned sat
[2024-05-25 12:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:52:35] [INFO ] [Real]Absence check using state equation in 4427 ms returned sat
[2024-05-25 12:52:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:52:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 12:52:36] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 255 ms returned sat
[2024-05-25 12:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:52:40] [INFO ] [Nat]Absence check using state equation in 4450 ms returned sat
[2024-05-25 12:52:40] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 12:52:42] [INFO ] [Nat]Added 6802 Read/Feed constraints in 1738 ms returned sat
[2024-05-25 12:52:43] [INFO ] Computed and/alt/rep : 4621/6661/4621 causal constraints (skipped 6224 transitions) in 1071 ms.
[2024-05-25 12:52:45] [INFO ] Added : 8 causal constraints over 2 iterations in 2979 ms. Result :sat
[2024-05-25 12:52:46] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 12:52:46] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 231 ms returned unsat
[2024-05-25 12:52:47] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2024-05-25 12:52:47] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 135 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 2, 1, 1] Max seen :[1, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 4625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4625/4625 places, 11756/11756 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4625 transition count 11753
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4622 transition count 11753
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 4622 transition count 11749
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 4618 transition count 11749
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 21 place count 4611 transition count 11742
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 4611 transition count 11742
Applied a total of 28 rules in 1499 ms. Remains 4611 /4625 variables (removed 14) and now considering 11742/11756 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1499 ms. Remains : 4611/4625 places, 11742/11756 transitions.
Normalized transition count is 10856 out of 11742 initially.
// Phase 1: matrix 10856 rows 4611 cols
[2024-05-25 12:52:49] [INFO ] Computed 1093 invariants in 257 ms
Interrupted random walk after 721218 steps, including 14584 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Interrupted Best-First random walk after 791869 steps, including 2054 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen 0
[2024-05-25 12:53:24] [INFO ] Flow matrix only has 10856 transitions (discarded 886 similar events)
// Phase 1: matrix 10856 rows 4611 cols
[2024-05-25 12:53:24] [INFO ] Computed 1093 invariants in 265 ms
[2024-05-25 12:53:25] [INFO ] [Real]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-05-25 12:53:25] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 263 ms returned sat
[2024-05-25 12:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:53:30] [INFO ] [Real]Absence check using state equation in 4847 ms returned sat
[2024-05-25 12:53:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:53:31] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 12:53:31] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 259 ms returned sat
[2024-05-25 12:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:53:36] [INFO ] [Nat]Absence check using state equation in 4850 ms returned sat
[2024-05-25 12:53:36] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 12:53:38] [INFO ] [Nat]Added 6802 Read/Feed constraints in 2186 ms returned sat
[2024-05-25 12:53:39] [INFO ] Computed and/alt/rep : 4611/6644/4611 causal constraints (skipped 6220 transitions) in 942 ms.
[2024-05-25 12:53:41] [INFO ] Added : 8 causal constraints over 2 iterations in 2639 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 4611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11742/11742 transitions.
Applied a total of 0 rules in 595 ms. Remains 4611 /4611 variables (removed 0) and now considering 11742/11742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 595 ms. Remains : 4611/4611 places, 11742/11742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11742/11742 transitions.
Applied a total of 0 rules in 597 ms. Remains 4611 /4611 variables (removed 0) and now considering 11742/11742 (removed 0) transitions.
[2024-05-25 12:53:43] [INFO ] Flow matrix only has 10856 transitions (discarded 886 similar events)
[2024-05-25 12:53:43] [INFO ] Invariant cache hit.
[2024-05-25 12:53:47] [INFO ] Implicit Places using invariants in 3880 ms returned []
Implicit Place search using SMT only with invariants took 3882 ms to find 0 implicit places.
[2024-05-25 12:53:47] [INFO ] Flow matrix only has 10856 transitions (discarded 886 similar events)
[2024-05-25 12:53:47] [INFO ] Invariant cache hit.
[2024-05-25 12:53:53] [INFO ] Dead Transitions using invariants and state equation in 6436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10920 ms. Remains : 4611/4611 places, 11742/11742 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-08
Normalized transition count is 10856 out of 11742 initially.
// Phase 1: matrix 10856 rows 4611 cols
[2024-05-25 12:53:53] [INFO ] Computed 1093 invariants in 267 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
[2024-05-25 12:53:54] [INFO ] Flow matrix only has 10856 transitions (discarded 886 similar events)
// Phase 1: matrix 10856 rows 4611 cols
[2024-05-25 12:53:54] [INFO ] Computed 1093 invariants in 261 ms
[2024-05-25 12:53:55] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 12:53:55] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 251 ms returned sat
[2024-05-25 12:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:53:59] [INFO ] [Real]Absence check using state equation in 4297 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 4611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11742/11742 transitions.
Applied a total of 0 rules in 620 ms. Remains 4611 /4611 variables (removed 0) and now considering 11742/11742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 4611/4611 places, 11742/11742 transitions.
Normalized transition count is 10856 out of 11742 initially.
// Phase 1: matrix 10856 rows 4611 cols
[2024-05-25 12:54:00] [INFO ] Computed 1093 invariants in 256 ms
Interrupted random walk after 729977 steps, including 14759 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Interrupted Best-First random walk after 799487 steps, including 2073 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 0
[2024-05-25 12:54:35] [INFO ] Flow matrix only has 10856 transitions (discarded 886 similar events)
// Phase 1: matrix 10856 rows 4611 cols
[2024-05-25 12:54:35] [INFO ] Computed 1093 invariants in 267 ms
[2024-05-25 12:54:36] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 12:54:36] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 259 ms returned sat
[2024-05-25 12:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:41] [INFO ] [Real]Absence check using state equation in 4854 ms returned sat
[2024-05-25 12:54:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:54:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 12:54:42] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 249 ms returned sat
[2024-05-25 12:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:54:47] [INFO ] [Nat]Absence check using state equation in 4801 ms returned sat
[2024-05-25 12:54:47] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 12:54:49] [INFO ] [Nat]Added 6802 Read/Feed constraints in 2248 ms returned sat
[2024-05-25 12:54:50] [INFO ] Computed and/alt/rep : 4611/6644/4611 causal constraints (skipped 6220 transitions) in 683 ms.
[2024-05-25 12:54:52] [INFO ] Added : 8 causal constraints over 2 iterations in 2388 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 4611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11742/11742 transitions.
Applied a total of 0 rules in 592 ms. Remains 4611 /4611 variables (removed 0) and now considering 11742/11742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 4611/4611 places, 11742/11742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4611/4611 places, 11742/11742 transitions.
Applied a total of 0 rules in 600 ms. Remains 4611 /4611 variables (removed 0) and now considering 11742/11742 (removed 0) transitions.
[2024-05-25 12:54:53] [INFO ] Flow matrix only has 10856 transitions (discarded 886 similar events)
[2024-05-25 12:54:53] [INFO ] Invariant cache hit.
[2024-05-25 12:54:58] [INFO ] Implicit Places using invariants in 4037 ms returned []
Implicit Place search using SMT only with invariants took 4038 ms to find 0 implicit places.
[2024-05-25 12:54:58] [INFO ] Flow matrix only has 10856 transitions (discarded 886 similar events)
[2024-05-25 12:54:58] [INFO ] Invariant cache hit.
[2024-05-25 12:55:04] [INFO ] Dead Transitions using invariants and state equation in 6013 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10670 ms. Remains : 4611/4611 places, 11742/11742 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-08 in 70479 ms.
[2024-05-25 12:55:05] [INFO ] Flatten gal took : 747 ms
[2024-05-25 12:55:05] [INFO ] Applying decomposition
[2024-05-25 12:55:05] [INFO ] Flatten gal took : 446 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13914984592573508720.txt' '-o' '/tmp/graph13914984592573508720.bin' '-w' '/tmp/graph13914984592573508720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13914984592573508720.bin' '-l' '-1' '-v' '-w' '/tmp/graph13914984592573508720.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:55:06] [INFO ] Decomposing Gal with order
[2024-05-25 12:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:55:10] [INFO ] Removed a total of 25664 redundant transitions.
[2024-05-25 12:55:11] [INFO ] Flatten gal took : 3379 ms
[2024-05-25 12:55:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6290 labels/synchronizations in 941 ms.
[2024-05-25 12:55:13] [INFO ] Time to serialize gal into /tmp/UpperBounds7999399059947970207.gal : 221 ms
[2024-05-25 12:55:13] [INFO ] Time to serialize properties into /tmp/UpperBounds4640805000039804479.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7999399059947970207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4640805000039804479.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4640805000039804479.prop.
Detected timeout of ITS tools.
[2024-05-25 13:16:59] [INFO ] Flatten gal took : 782 ms
[2024-05-25 13:17:00] [INFO ] Time to serialize gal into /tmp/UpperBounds2275638157869822381.gal : 150 ms
[2024-05-25 13:17:00] [INFO ] Time to serialize properties into /tmp/UpperBounds11858060151684672844.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2275638157869822381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11858060151684672844.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds11858060151684672844.prop.
Detected timeout of ITS tools.
[2024-05-25 13:39:02] [INFO ] Flatten gal took : 1966 ms
[2024-05-25 13:39:22] [INFO ] Input system was already deterministic with 11742 transitions.
[2024-05-25 13:39:22] [INFO ] Transformed 4611 places.
[2024-05-25 13:39:22] [INFO ] Transformed 11742 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 13:39:53] [INFO ] Time to serialize gal into /tmp/UpperBounds17605610320164281050.gal : 69 ms
[2024-05-25 13:39:53] [INFO ] Time to serialize properties into /tmp/UpperBounds11943444841775163961.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17605610320164281050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11943444841775163961.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds11943444841775163961.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1351308 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16112160 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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="MultiCrashLeafsetExtension-PT-S24C08"
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 MultiCrashLeafsetExtension-PT-S24C08, 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 r263-tall-171654372000066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C08.tgz
mv MultiCrashLeafsetExtension-PT-S24C08 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 ;