About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.352 | 3600000.00 | 3118075.00 | 339833.50 | 1 1 1 1 ? 1 1 1 ? 1 1 1 1 0 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/mcc2023-input.r229-tall-167856413800845.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S24C07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413800845
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 26 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 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-S24C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679587296093
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C07
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-23 16:01:37] [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]
[2023-03-23 16:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:01:38] [INFO ] Load time of PNML (sax parser for PT used): 470 ms
[2023-03-23 16:01:38] [INFO ] Transformed 13822 places.
[2023-03-23 16:01:38] [INFO ] Transformed 20365 transitions.
[2023-03-23 16:01:38] [INFO ] Parsed PT model containing 13822 places and 20365 transitions and 77774 arcs in 685 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 19765 out of 20365 initially.
// Phase 1: matrix 19765 rows 13822 cols
[2023-03-23 16:01:40] [INFO ] Computed 1083 place invariants in 1503 ms
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 138 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :2
[2023-03-23 16:01:41] [INFO ] Flow matrix only has 19765 transitions (discarded 600 similar events)
// Phase 1: matrix 19765 rows 13822 cols
[2023-03-23 16:01:42] [INFO ] Computed 1083 place invariants in 1410 ms
[2023-03-23 16:01:44] [INFO ] [Real]Absence check using 68 positive place invariants in 272 ms returned sat
[2023-03-23 16:01:44] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 191 ms returned unsat
[2023-03-23 16:01:46] [INFO ] [Real]Absence check using 68 positive place invariants in 258 ms returned sat
[2023-03-23 16:01:46] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 183 ms returned unsat
[2023-03-23 16:01:47] [INFO ] [Real]Absence check using 68 positive place invariants in 253 ms returned sat
[2023-03-23 16:01:48] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 188 ms returned unsat
[2023-03-23 16:01:49] [INFO ] [Real]Absence check using 68 positive place invariants in 268 ms returned sat
[2023-03-23 16:01:50] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 190 ms returned unsat
[2023-03-23 16:01:51] [INFO ] [Real]Absence check using 68 positive place invariants in 261 ms returned sat
[2023-03-23 16:01:52] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 653 ms returned sat
[2023-03-23 16:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:01:55] [INFO ] [Real]Absence check using state equation in 2696 ms returned unknown
[2023-03-23 16:01:56] [INFO ] [Real]Absence check using 68 positive place invariants in 258 ms returned sat
[2023-03-23 16:01:56] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 185 ms returned unsat
[2023-03-23 16:01:58] [INFO ] [Real]Absence check using 68 positive place invariants in 243 ms returned sat
[2023-03-23 16:01:58] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 646 ms returned sat
[2023-03-23 16:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:02:01] [INFO ] [Real]Absence check using state equation in 2937 ms returned unknown
[2023-03-23 16:02:03] [INFO ] [Real]Absence check using 68 positive place invariants in 243 ms returned sat
[2023-03-23 16:02:03] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 608 ms returned sat
[2023-03-23 16:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:02:06] [INFO ] [Real]Absence check using state equation in 2913 ms returned unknown
[2023-03-23 16:02:08] [INFO ] [Real]Absence check using 68 positive place invariants in 251 ms returned sat
[2023-03-23 16:02:08] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 194 ms returned unsat
[2023-03-23 16:02:10] [INFO ] [Real]Absence check using 68 positive place invariants in 260 ms returned sat
[2023-03-23 16:02:10] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 674 ms returned sat
[2023-03-23 16:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:02:13] [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 9
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:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-23 16:02:15] [INFO ] [Real]Absence check using 68 positive place invariants in 264 ms returned sat
[2023-03-23 16:02:15] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 186 ms returned unsat
[2023-03-23 16:02:16] [INFO ] [Real]Absence check using 68 positive place invariants in 249 ms returned sat
[2023-03-23 16:02:17] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 382 ms returned unsat
[2023-03-23 16:02:18] [INFO ] [Real]Absence check using 68 positive place invariants in 245 ms returned sat
[2023-03-23 16:02:19] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 660 ms returned sat
[2023-03-23 16:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:02:22] [INFO ] [Real]Absence check using state equation in 2886 ms returned unknown
[2023-03-23 16:02:23] [INFO ] [Real]Absence check using 68 positive place invariants in 249 ms returned sat
[2023-03-23 16:02:24] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 582 ms returned sat
[2023-03-23 16:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:02:27] [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 13
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-23 16:02:28] [INFO ] [Real]Absence check using 68 positive place invariants in 254 ms returned sat
[2023-03-23 16:02:29] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 624 ms returned sat
[2023-03-23 16:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:02:32] [INFO ] [Real]Absence check using state equation in 2843 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 25, 1, 75, 1, 1, 25, 1, 1, 1, 25, 25] Max seen :[1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 13822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13822/13822 places, 20365/20365 transitions.
Graph (complete) has 45351 edges and 13822 vertex of which 13780 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.41 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 4195 transitions
Trivial Post-agglo rules discarded 4195 transitions
Performed 4195 trivial Post agglomeration. Transition count delta: 4195
Iterating post reduction 0 with 4195 rules applied. Total rules applied 4196 place count 13780 transition count 16170
Reduce places removed 4195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4196 rules applied. Total rules applied 8392 place count 9585 transition count 16169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8393 place count 9584 transition count 16169
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 350 Pre rules applied. Total rules applied 8393 place count 9584 transition count 15819
Deduced a syphon composed of 350 places in 15 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 9093 place count 9234 transition count 15819
Discarding 3845 places :
Symmetric choice reduction at 3 with 3845 rule applications. Total rules 12938 place count 5389 transition count 11974
Iterating global reduction 3 with 3845 rules applied. Total rules applied 16783 place count 5389 transition count 11974
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 16783 place count 5389 transition count 11963
Deduced a syphon composed of 11 places in 29 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 16805 place count 5378 transition count 11963
Discarding 545 places :
Symmetric choice reduction at 3 with 545 rule applications. Total rules 17350 place count 4833 transition count 8148
Iterating global reduction 3 with 545 rules applied. Total rules applied 17895 place count 4833 transition count 8148
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 17945 place count 4808 transition count 8123
Free-agglomeration rule (complex) applied 341 times.
Iterating global reduction 3 with 341 rules applied. Total rules applied 18286 place count 4808 transition count 11052
Reduce places removed 341 places and 0 transitions.
Iterating post reduction 3 with 341 rules applied. Total rules applied 18627 place count 4467 transition count 11052
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 18702 place count 4467 transition count 11052
Applied a total of 18702 rules in 4711 ms. Remains 4467 /13822 variables (removed 9355) and now considering 11052/20365 (removed 9313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4714 ms. Remains : 4467/13822 places, 11052/20365 transitions.
Normalized transition count is 10166 out of 11052 initially.
// Phase 1: matrix 10166 rows 4467 cols
[2023-03-23 16:02:37] [INFO ] Computed 1041 place invariants in 284 ms
Interrupted random walk after 775224 steps, including 17871 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 2
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 863719 steps, including 2507 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 0
Interrupted Best-First random walk after 860263 steps, including 2498 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 1
Interrupted Best-First random walk after 864974 steps, including 2511 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 0
Interrupted Best-First random walk after 865230 steps, including 2512 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 1
Interrupted Best-First random walk after 864310 steps, including 2509 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 1
Interrupted Best-First random walk after 856815 steps, including 2488 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
[2023-03-23 16:03:37] [INFO ] Flow matrix only has 10166 transitions (discarded 886 similar events)
// Phase 1: matrix 10166 rows 4467 cols
[2023-03-23 16:03:37] [INFO ] Computed 1041 place invariants in 272 ms
[2023-03-23 16:03:38] [INFO ] [Real]Absence check using 49 positive place invariants in 104 ms returned sat
[2023-03-23 16:03:38] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 239 ms returned sat
[2023-03-23 16:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:03:43] [INFO ] [Real]Absence check using state equation in 4857 ms returned sat
[2023-03-23 16:03:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:03:44] [INFO ] [Nat]Absence check using 49 positive place invariants in 100 ms returned sat
[2023-03-23 16:03:44] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 254 ms returned sat
[2023-03-23 16:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:03:48] [INFO ] [Nat]Absence check using state equation in 4604 ms returned sat
[2023-03-23 16:03:49] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2023-03-23 16:03:51] [INFO ] [Nat]Added 6202 Read/Feed constraints in 2703 ms returned sat
[2023-03-23 16:03:57] [INFO ] Deduced a trap composed of 487 places in 5339 ms of which 8 ms to minimize.
[2023-03-23 16:04:04] [INFO ] Deduced a trap composed of 418 places in 5137 ms of which 4 ms to minimize.
[2023-03-23 16:04:11] [INFO ] Deduced a trap composed of 256 places in 5314 ms of which 5 ms to minimize.
[2023-03-23 16:04:17] [INFO ] Deduced a trap composed of 271 places in 5334 ms of which 5 ms to minimize.
[2023-03-23 16:04:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 28333 ms
[2023-03-23 16:04:21] [INFO ] Computed and/alt/rep : 4619/6656/4619 causal constraints (skipped 5522 transitions) in 954 ms.
[2023-03-23 16:04:22] [INFO ] Added : 8 causal constraints over 2 iterations in 2732 ms. Result :sat
[2023-03-23 16:04:23] [INFO ] [Real]Absence check using 49 positive place invariants in 101 ms returned sat
[2023-03-23 16:04:23] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 49 ms returned unsat
[2023-03-23 16:04:24] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2023-03-23 16:04:24] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 251 ms returned sat
[2023-03-23 16:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:04:29] [INFO ] [Real]Absence check using state equation in 4616 ms returned sat
[2023-03-23 16:04:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:04:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-23 16:04:30] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 250 ms returned sat
[2023-03-23 16:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:04:35] [INFO ] [Nat]Absence check using state equation in 4963 ms returned sat
[2023-03-23 16:04:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:04:41] [INFO ] [Nat]Added 6202 Read/Feed constraints in 6380 ms returned unknown
[2023-03-23 16:04:41] [INFO ] [Real]Absence check using 49 positive place invariants in 92 ms returned sat
[2023-03-23 16:04:42] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 260 ms returned sat
[2023-03-23 16:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:04:46] [INFO ] [Real]Absence check using state equation in 3904 ms returned sat
[2023-03-23 16:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:04:46] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-23 16:04:47] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 251 ms returned sat
[2023-03-23 16:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:04:52] [INFO ] [Nat]Absence check using state equation in 5101 ms returned sat
[2023-03-23 16:04:55] [INFO ] [Nat]Added 6202 Read/Feed constraints in 3086 ms returned sat
[2023-03-23 16:05:00] [INFO ] Deduced a trap composed of 375 places in 5124 ms of which 6 ms to minimize.
[2023-03-23 16:05:08] [INFO ] Deduced a trap composed of 251 places in 5284 ms of which 5 ms to minimize.
[2023-03-23 16:05:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 14000 ms
[2023-03-23 16:05:10] [INFO ] Computed and/alt/rep : 4619/6656/4619 causal constraints (skipped 5522 transitions) in 992 ms.
[2023-03-23 16:05:12] [INFO ] Added : 8 causal constraints over 2 iterations in 2701 ms. Result :sat
[2023-03-23 16:05:12] [INFO ] [Real]Absence check using 49 positive place invariants in 95 ms returned sat
[2023-03-23 16:05:13] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 269 ms returned sat
[2023-03-23 16:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:05:18] [INFO ] [Real]Absence check using state equation in 5119 ms returned sat
[2023-03-23 16:05:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:05:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 89 ms returned sat
[2023-03-23 16:05:19] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 263 ms returned sat
[2023-03-23 16:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:05:24] [INFO ] [Nat]Absence check using state equation in 4877 ms returned sat
[2023-03-23 16:05:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:05:29] [INFO ] [Nat]Added 6202 Read/Feed constraints in 4952 ms returned unsat
[2023-03-23 16:05:29] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2023-03-23 16:05:29] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 238 ms returned sat
[2023-03-23 16:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:05:33] [INFO ] [Real]Absence check using state equation in 4163 ms returned sat
[2023-03-23 16:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:05:34] [INFO ] [Nat]Absence check using 49 positive place invariants in 95 ms returned sat
[2023-03-23 16:05:34] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 262 ms returned sat
[2023-03-23 16:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:05:40] [INFO ] [Nat]Absence check using state equation in 5401 ms returned sat
[2023-03-23 16:05:41] [INFO ] [Nat]Added 6202 Read/Feed constraints in 1412 ms returned sat
[2023-03-23 16:05:42] [INFO ] Computed and/alt/rep : 4619/6656/4619 causal constraints (skipped 5522 transitions) in 731 ms.
[2023-03-23 16:05:44] [INFO ] Added : 7 causal constraints over 2 iterations in 2518 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 0, 1] Max seen :[0, 1, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 4467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4467/4467 places, 11052/11052 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4467 transition count 11050
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4465 transition count 11050
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 4465 transition count 11049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 4464 transition count 11049
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 4463 transition count 11048
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 4463 transition count 11048
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 4463 transition count 11048
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 4461 transition count 11046
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 4461 transition count 11046
Applied a total of 14 rules in 2156 ms. Remains 4461 /4467 variables (removed 6) and now considering 11046/11052 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2156 ms. Remains : 4461/4467 places, 11046/11052 transitions.
Normalized transition count is 10160 out of 11046 initially.
// Phase 1: matrix 10160 rows 4461 cols
[2023-03-23 16:05:48] [INFO ] Computed 1041 place invariants in 279 ms
Interrupted random walk after 773334 steps, including 17829 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 852104 steps, including 2474 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 852925 steps, including 2476 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
[2023-03-23 16:06:28] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
// Phase 1: matrix 10160 rows 4461 cols
[2023-03-23 16:06:28] [INFO ] Computed 1041 place invariants in 272 ms
[2023-03-23 16:06:28] [INFO ] [Real]Absence check using 47 positive place invariants in 83 ms returned sat
[2023-03-23 16:06:29] [INFO ] [Real]Absence check using 47 positive and 994 generalized place invariants in 259 ms returned sat
[2023-03-23 16:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:06:33] [INFO ] [Real]Absence check using state equation in 4042 ms returned sat
[2023-03-23 16:06:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:06:33] [INFO ] [Nat]Absence check using 47 positive place invariants in 84 ms returned sat
[2023-03-23 16:06:34] [INFO ] [Nat]Absence check using 47 positive and 994 generalized place invariants in 275 ms returned sat
[2023-03-23 16:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:06:38] [INFO ] [Nat]Absence check using state equation in 4083 ms returned sat
[2023-03-23 16:06:38] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2023-03-23 16:06:40] [INFO ] [Nat]Added 6202 Read/Feed constraints in 2381 ms returned sat
[2023-03-23 16:06:46] [INFO ] Deduced a trap composed of 494 places in 5013 ms of which 5 ms to minimize.
[2023-03-23 16:06:52] [INFO ] Deduced a trap composed of 423 places in 5340 ms of which 7 ms to minimize.
[2023-03-23 16:06:59] [INFO ] Deduced a trap composed of 328 places in 5322 ms of which 4 ms to minimize.
[2023-03-23 16:07:04] [INFO ] Deduced a trap composed of 360 places in 5252 ms of which 4 ms to minimize.
[2023-03-23 16:07:11] [INFO ] Deduced a trap composed of 245 places in 5360 ms of which 4 ms to minimize.
[2023-03-23 16:07:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 31919 ms
[2023-03-23 16:07:13] [INFO ] Computed and/alt/rep : 4614/6648/4614 causal constraints (skipped 5521 transitions) in 736 ms.
[2023-03-23 16:07:15] [INFO ] Added : 8 causal constraints over 2 iterations in 2659 ms. Result :sat
[2023-03-23 16:07:16] [INFO ] [Real]Absence check using 47 positive place invariants in 74 ms returned sat
[2023-03-23 16:07:16] [INFO ] [Real]Absence check using 47 positive and 994 generalized place invariants in 248 ms returned sat
[2023-03-23 16:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:07:20] [INFO ] [Real]Absence check using state equation in 3757 ms returned sat
[2023-03-23 16:07:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:07:20] [INFO ] [Nat]Absence check using 47 positive place invariants in 72 ms returned sat
[2023-03-23 16:07:21] [INFO ] [Nat]Absence check using 47 positive and 994 generalized place invariants in 250 ms returned sat
[2023-03-23 16:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:07:25] [INFO ] [Nat]Absence check using state equation in 4600 ms returned sat
[2023-03-23 16:07:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:07:32] [INFO ] [Nat]Added 6202 Read/Feed constraints in 6363 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 4461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 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 0 with 1 rules applied. Total rules applied 1 place count 4461 transition count 11045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4460 transition count 11045
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4460 transition count 11044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4459 transition count 11044
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 4458 transition count 11043
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 4458 transition count 11043
Applied a total of 6 rules in 1380 ms. Remains 4458 /4461 variables (removed 3) and now considering 11043/11046 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1380 ms. Remains : 4458/4461 places, 11043/11046 transitions.
Normalized transition count is 10157 out of 11043 initially.
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:07:33] [INFO ] Computed 1041 place invariants in 267 ms
Interrupted random walk after 774467 steps, including 17857 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Interrupted Best-First random walk after 854830 steps, including 2482 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 854815 steps, including 2482 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
[2023-03-23 16:08:13] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:08:14] [INFO ] Computed 1041 place invariants in 281 ms
[2023-03-23 16:08:14] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-23 16:08:14] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 233 ms returned sat
[2023-03-23 16:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:08:19] [INFO ] [Real]Absence check using state equation in 4523 ms returned sat
[2023-03-23 16:08:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:08:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2023-03-23 16:08:20] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 238 ms returned sat
[2023-03-23 16:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:08:24] [INFO ] [Nat]Absence check using state equation in 3932 ms returned sat
[2023-03-23 16:08:24] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2023-03-23 16:08:25] [INFO ] [Nat]Added 6202 Read/Feed constraints in 1553 ms returned sat
[2023-03-23 16:08:31] [INFO ] Deduced a trap composed of 457 places in 5178 ms of which 5 ms to minimize.
[2023-03-23 16:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6336 ms
[2023-03-23 16:08:32] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 5520 transitions) in 653 ms.
[2023-03-23 16:08:34] [INFO ] Added : 8 causal constraints over 2 iterations in 2226 ms. Result :sat
[2023-03-23 16:08:35] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2023-03-23 16:08:35] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 264 ms returned sat
[2023-03-23 16:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:08:40] [INFO ] [Real]Absence check using state equation in 4530 ms returned sat
[2023-03-23 16:08:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:08:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2023-03-23 16:08:41] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 247 ms returned sat
[2023-03-23 16:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:08:44] [INFO ] [Nat]Absence check using state equation in 3801 ms returned sat
[2023-03-23 16:08:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:08:50] [INFO ] [Nat]Added 6202 Read/Feed constraints in 5930 ms returned sat
[2023-03-23 16:08:56] [INFO ] Deduced a trap composed of 632 places in 5042 ms of which 6 ms to minimize.
[2023-03-23 16:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5641 ms
[2023-03-23 16:08:57] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 5520 transitions) in 758 ms.
[2023-03-23 16:08:59] [INFO ] Added : 13 causal constraints over 3 iterations in 3064 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 4458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 transitions.
Applied a total of 0 rules in 622 ms. Remains 4458 /4458 variables (removed 0) and now considering 11043/11043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 4458/4458 places, 11043/11043 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 transitions.
Applied a total of 0 rules in 543 ms. Remains 4458 /4458 variables (removed 0) and now considering 11043/11043 (removed 0) transitions.
[2023-03-23 16:09:01] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
[2023-03-23 16:09:01] [INFO ] Invariant cache hit.
[2023-03-23 16:09:06] [INFO ] Implicit Places using invariants in 5557 ms returned []
Implicit Place search using SMT only with invariants took 5558 ms to find 0 implicit places.
[2023-03-23 16:09:06] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
[2023-03-23 16:09:07] [INFO ] Invariant cache hit.
[2023-03-23 16:09:13] [INFO ] Dead Transitions using invariants and state equation in 6241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12352 ms. Remains : 4458/4458 places, 11043/11043 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-04
Normalized transition count is 10157 out of 11043 initially.
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:09:13] [INFO ] Computed 1041 place invariants in 266 ms
Incomplete random walk after 10000 steps, including 230 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
[2023-03-23 16:09:14] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:09:14] [INFO ] Computed 1041 place invariants in 265 ms
[2023-03-23 16:09:14] [INFO ] [Real]Absence check using 49 positive place invariants in 95 ms returned sat
[2023-03-23 16:09:15] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 265 ms returned sat
[2023-03-23 16:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:09:19] [INFO ] [Real]Absence check using state equation in 4268 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 transitions.
Applied a total of 0 rules in 610 ms. Remains 4458 /4458 variables (removed 0) and now considering 11043/11043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 613 ms. Remains : 4458/4458 places, 11043/11043 transitions.
Normalized transition count is 10157 out of 11043 initially.
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:09:20] [INFO ] Computed 1041 place invariants in 278 ms
Interrupted random walk after 745588 steps, including 17188 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Interrupted Best-First random walk after 813462 steps, including 2362 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 0
[2023-03-23 16:09:55] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:09:55] [INFO ] Computed 1041 place invariants in 279 ms
[2023-03-23 16:09:56] [INFO ] [Real]Absence check using 49 positive place invariants in 92 ms returned sat
[2023-03-23 16:09:56] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 255 ms returned sat
[2023-03-23 16:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:10:01] [INFO ] [Real]Absence check using state equation in 5108 ms returned sat
[2023-03-23 16:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:10:02] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-23 16:10:02] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 261 ms returned sat
[2023-03-23 16:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:10:07] [INFO ] [Nat]Absence check using state equation in 4726 ms returned sat
[2023-03-23 16:10:07] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2023-03-23 16:10:08] [INFO ] [Nat]Added 6202 Read/Feed constraints in 1661 ms returned sat
[2023-03-23 16:10:14] [INFO ] Deduced a trap composed of 457 places in 5222 ms of which 4 ms to minimize.
[2023-03-23 16:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6589 ms
[2023-03-23 16:10:16] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 5520 transitions) in 659 ms.
[2023-03-23 16:10:17] [INFO ] Added : 8 causal constraints over 2 iterations in 2446 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 transitions.
Applied a total of 0 rules in 581 ms. Remains 4458 /4458 variables (removed 0) and now considering 11043/11043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 4458/4458 places, 11043/11043 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 transitions.
Applied a total of 0 rules in 570 ms. Remains 4458 /4458 variables (removed 0) and now considering 11043/11043 (removed 0) transitions.
[2023-03-23 16:10:19] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
[2023-03-23 16:10:19] [INFO ] Invariant cache hit.
[2023-03-23 16:10:25] [INFO ] Implicit Places using invariants in 5831 ms returned []
Implicit Place search using SMT only with invariants took 5832 ms to find 0 implicit places.
[2023-03-23 16:10:25] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
[2023-03-23 16:10:25] [INFO ] Invariant cache hit.
[2023-03-23 16:10:32] [INFO ] Dead Transitions using invariants and state equation in 6679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13086 ms. Remains : 4458/4458 places, 11043/11043 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-04 in 78912 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08
Normalized transition count is 10157 out of 11043 initially.
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:10:32] [INFO ] Computed 1041 place invariants in 278 ms
Incomplete random walk after 10000 steps, including 230 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2023-03-23 16:10:32] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
// Phase 1: matrix 10157 rows 4458 cols
[2023-03-23 16:10:33] [INFO ] Computed 1041 place invariants in 282 ms
[2023-03-23 16:10:33] [INFO ] [Real]Absence check using 49 positive place invariants in 86 ms returned sat
[2023-03-23 16:10:34] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 257 ms returned sat
[2023-03-23 16:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:10:38] [INFO ] [Real]Absence check using state equation in 4243 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 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 0 with 1 rules applied. Total rules applied 1 place count 4458 transition count 11042
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4457 transition count 11042
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4457 transition count 11041
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 4456 transition count 11041
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 4455 transition count 11040
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 4455 transition count 11040
Applied a total of 6 rules in 1475 ms. Remains 4455 /4458 variables (removed 3) and now considering 11040/11043 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1475 ms. Remains : 4455/4458 places, 11040/11043 transitions.
Normalized transition count is 10154 out of 11040 initially.
// Phase 1: matrix 10154 rows 4455 cols
[2023-03-23 16:10:40] [INFO ] Computed 1041 place invariants in 277 ms
Interrupted random walk after 735076 steps, including 16947 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Interrupted Best-First random walk after 821755 steps, including 2386 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
[2023-03-23 16:11:15] [INFO ] Flow matrix only has 10154 transitions (discarded 886 similar events)
// Phase 1: matrix 10154 rows 4455 cols
[2023-03-23 16:11:15] [INFO ] Computed 1041 place invariants in 279 ms
[2023-03-23 16:11:15] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2023-03-23 16:11:16] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 253 ms returned sat
[2023-03-23 16:11:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:11:20] [INFO ] [Real]Absence check using state equation in 4361 ms returned sat
[2023-03-23 16:11:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:11:21] [INFO ] [Nat]Absence check using 49 positive place invariants in 100 ms returned sat
[2023-03-23 16:11:21] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 234 ms returned sat
[2023-03-23 16:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:11:25] [INFO ] [Nat]Absence check using state equation in 4535 ms returned sat
[2023-03-23 16:11:26] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2023-03-23 16:11:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 16:11:32] [INFO ] [Nat]Added 6202 Read/Feed constraints in 6365 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 4455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4455/4455 places, 11040/11040 transitions.
Applied a total of 0 rules in 609 ms. Remains 4455 /4455 variables (removed 0) and now considering 11040/11040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 4455/4455 places, 11040/11040 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4455/4455 places, 11040/11040 transitions.
Applied a total of 0 rules in 598 ms. Remains 4455 /4455 variables (removed 0) and now considering 11040/11040 (removed 0) transitions.
[2023-03-23 16:11:33] [INFO ] Flow matrix only has 10154 transitions (discarded 886 similar events)
[2023-03-23 16:11:33] [INFO ] Invariant cache hit.
[2023-03-23 16:11:37] [INFO ] Implicit Places using invariants in 4013 ms returned []
Implicit Place search using SMT only with invariants took 4022 ms to find 0 implicit places.
[2023-03-23 16:11:37] [INFO ] Flow matrix only has 10154 transitions (discarded 886 similar events)
[2023-03-23 16:11:37] [INFO ] Invariant cache hit.
[2023-03-23 16:11:43] [INFO ] Dead Transitions using invariants and state equation in 5829 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10453 ms. Remains : 4455/4455 places, 11040/11040 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08 in 71279 ms.
[2023-03-23 16:11:44] [INFO ] Flatten gal took : 738 ms
[2023-03-23 16:11:44] [INFO ] Applying decomposition
[2023-03-23 16:11:45] [INFO ] Flatten gal took : 432 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14829257146495225149.txt' '-o' '/tmp/graph14829257146495225149.bin' '-w' '/tmp/graph14829257146495225149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14829257146495225149.bin' '-l' '-1' '-v' '-w' '/tmp/graph14829257146495225149.weights' '-q' '0' '-e' '0.001'
[2023-03-23 16:11:46] [INFO ] Decomposing Gal with order
[2023-03-23 16:11:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 16:11:50] [INFO ] Removed a total of 17670 redundant transitions.
[2023-03-23 16:11:50] [INFO ] Flatten gal took : 3651 ms
[2023-03-23 16:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 9232 labels/synchronizations in 1059 ms.
[2023-03-23 16:11:52] [INFO ] Time to serialize gal into /tmp/UpperBounds5454771797119738722.gal : 144 ms
[2023-03-23 16:11:52] [INFO ] Time to serialize properties into /tmp/UpperBounds9141898036724574746.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5454771797119738722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9141898036724574746.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds9141898036724574746.prop.
Detected timeout of ITS tools.
[2023-03-23 16:35:32] [INFO ] Flatten gal took : 2355 ms
[2023-03-23 16:35:33] [INFO ] Time to serialize gal into /tmp/UpperBounds1842741467085672499.gal : 255 ms
[2023-03-23 16:35:33] [INFO ] Time to serialize properties into /tmp/UpperBounds14603761613411199134.prop : 3 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1842741467085672499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14603761613411199134.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds14603761613411199134.prop.
Detected timeout of ITS tools.
[2023-03-23 16:59:15] [INFO ] Flatten gal took : 1138 ms
[2023-03-23 16:59:17] [INFO ] Input system was already deterministic with 11043 transitions.
[2023-03-23 16:59:17] [INFO ] Transformed 4458 places.
[2023-03-23 16:59:17] [INFO ] Transformed 11043 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
[2023-03-23 16:59:51] [INFO ] Time to serialize gal into /tmp/UpperBounds13952230248268961521.gal : 75 ms
[2023-03-23 16:59:51] [INFO ] Time to serialize properties into /tmp/UpperBounds14318394037065550681.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13952230248268961521.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14318394037065550681.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14318394037065550681.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13139040 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15133976 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-S24C07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C07, 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 r229-tall-167856413800845"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C07.tgz
mv MultiCrashLeafsetExtension-PT-S24C07 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 ;