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.r010-oct2-167813598700158.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ASLink-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598700158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 920K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678673690291

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 02:14:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 02:14:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 02:14:53] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-13 02:14:53] [INFO ] Transformed 2186 places.
[2023-03-13 02:14:53] [INFO ] Transformed 3192 transitions.
[2023-03-13 02:14:53] [INFO ] Found NUPN structural information;
[2023-03-13 02:14:53] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 39 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 13) seen :6
FORMULA ASLink-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3158 rows 2186 cols
[2023-03-13 02:14:54] [INFO ] Computed 422 place invariants in 153 ms
[2023-03-13 02:14:56] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 02:14:56] [INFO ] [Nat]Absence check using 105 positive place invariants in 45 ms returned sat
[2023-03-13 02:14:57] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 127 ms returned sat
[2023-03-13 02:15:21] [INFO ] After 23717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 02:15:21] [INFO ] After 23724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 02:15:21] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 101 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 38 places
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 2129 transition count 2979
Reduce places removed 179 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 188 rules applied. Total rules applied 424 place count 1950 transition count 2970
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 433 place count 1941 transition count 2970
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 190 Pre rules applied. Total rules applied 433 place count 1941 transition count 2780
Deduced a syphon composed of 190 places in 5 ms
Ensure Unique test removed 70 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 883 place count 1681 transition count 2780
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 884 place count 1681 transition count 2779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 885 place count 1680 transition count 2779
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 897 place count 1668 transition count 2709
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 910 place count 1667 transition count 2709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 911 place count 1667 transition count 2708
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 912 place count 1666 transition count 2700
Iterating global reduction 6 with 1 rules applied. Total rules applied 913 place count 1666 transition count 2700
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 914 place count 1665 transition count 2692
Iterating global reduction 6 with 1 rules applied. Total rules applied 915 place count 1665 transition count 2692
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 916 place count 1664 transition count 2684
Iterating global reduction 6 with 1 rules applied. Total rules applied 917 place count 1664 transition count 2684
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 918 place count 1663 transition count 2676
Iterating global reduction 6 with 1 rules applied. Total rules applied 919 place count 1663 transition count 2676
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 1031 place count 1607 transition count 2620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1033 place count 1606 transition count 2623
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1036 place count 1606 transition count 2620
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1039 place count 1603 transition count 2620
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1047 place count 1603 transition count 2612
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1055 place count 1595 transition count 2612
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1068 place count 1595 transition count 2612
Applied a total of 1068 rules in 1304 ms. Remains 1595 /2186 variables (removed 591) and now considering 2612/3158 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1304 ms. Remains : 1595/2186 places, 2612/3158 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 7) seen :1
FORMULA ASLink-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :1
FORMULA ASLink-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2612 rows 1595 cols
[2023-03-13 02:15:23] [INFO ] Computed 294 place invariants in 67 ms
[2023-03-13 02:15:23] [INFO ] [Real]Absence check using 71 positive place invariants in 18 ms returned sat
[2023-03-13 02:15:23] [INFO ] [Real]Absence check using 71 positive and 223 generalized place invariants in 168 ms returned sat
[2023-03-13 02:15:23] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 02:15:24] [INFO ] [Nat]Absence check using 71 positive place invariants in 33 ms returned sat
[2023-03-13 02:15:24] [INFO ] [Nat]Absence check using 71 positive and 223 generalized place invariants in 158 ms returned sat
[2023-03-13 02:15:46] [INFO ] After 22235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 02:15:46] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-13 02:15:48] [INFO ] After 1969ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 02:15:48] [INFO ] After 1983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 02:15:48] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 430 ms.
Support contains 46 out of 1595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1595/1595 places, 2612/2612 transitions.
Ensure Unique test removed 2 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1592 transition count 2606
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 1586 transition count 2606
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 15 place count 1586 transition count 2591
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 54 place count 1562 transition count 2591
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 1558 transition count 2587
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1558 transition count 2585
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 72 place count 1555 transition count 2580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 1554 transition count 2579
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 1554 transition count 2577
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 1552 transition count 2577
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 1552 transition count 2577
Applied a total of 80 rules in 620 ms. Remains 1552 /1595 variables (removed 43) and now considering 2577/2612 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 1552/1595 places, 2577/2612 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 86819 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86819 steps, saw 26847 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2577 rows 1552 cols
[2023-03-13 02:15:53] [INFO ] Computed 281 place invariants in 55 ms
[2023-03-13 02:15:53] [INFO ] [Real]Absence check using 72 positive place invariants in 19 ms returned sat
[2023-03-13 02:15:53] [INFO ] [Real]Absence check using 72 positive and 209 generalized place invariants in 88 ms returned sat
[2023-03-13 02:15:53] [INFO ] After 595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 02:15:54] [INFO ] [Nat]Absence check using 72 positive place invariants in 75 ms returned sat
[2023-03-13 02:15:54] [INFO ] [Nat]Absence check using 72 positive and 209 generalized place invariants in 184 ms returned sat
[2023-03-13 02:16:18] [INFO ] After 24140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 02:16:18] [INFO ] State equation strengthened by 59 read => feed constraints.
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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-13 02:16:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 02:16:18] [INFO ] After 25083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 172 ms.
Support contains 46 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 2577/2577 transitions.
Applied a total of 0 rules in 58 ms. Remains 1552 /1552 variables (removed 0) and now considering 2577/2577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1552/1552 places, 2577/2577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 2577/2577 transitions.
Applied a total of 0 rules in 53 ms. Remains 1552 /1552 variables (removed 0) and now considering 2577/2577 (removed 0) transitions.
[2023-03-13 02:16:19] [INFO ] Invariant cache hit.
[2023-03-13 02:16:20] [INFO ] Implicit Places using invariants in 1575 ms returned [1, 19, 20, 22, 32, 50, 68, 149, 162, 163, 164, 165, 166, 184, 202, 274, 286, 299, 300, 301, 302, 303, 321, 339, 401, 421, 434, 435, 436, 437, 438, 456, 474, 555, 568, 571, 572, 573, 591, 609, 690, 703, 706, 707, 708, 726, 815, 827, 840, 841, 842, 843, 844, 862, 880, 961, 974, 975, 976, 977, 978, 996, 1014, 1085, 1099, 1112, 1114, 1115, 1116, 1134, 1152, 1232, 1247, 1249, 1250, 1251, 1269, 1287, 1368, 1373, 1384, 1385, 1386, 1387, 1388, 1418, 1420, 1423, 1441, 1442, 1443, 1444, 1456, 1462, 1468, 1474, 1480, 1486, 1492, 1498, 1504, 1510, 1516]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1582 ms to find 103 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1449/1552 places, 2577/2577 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 1449 transition count 2424
Reduce places removed 153 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 169 rules applied. Total rules applied 322 place count 1296 transition count 2408
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 338 place count 1280 transition count 2408
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 338 place count 1280 transition count 2344
Deduced a syphon composed of 64 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 467 place count 1215 transition count 2344
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 36 rules applied. Total rules applied 503 place count 1195 transition count 2328
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 519 place count 1179 transition count 2328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 519 place count 1179 transition count 2327
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 521 place count 1178 transition count 2327
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 535 place count 1164 transition count 2313
Iterating global reduction 5 with 14 rules applied. Total rules applied 549 place count 1164 transition count 2313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 551 place count 1164 transition count 2311
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 555 place count 1160 transition count 2307
Iterating global reduction 6 with 4 rules applied. Total rules applied 559 place count 1160 transition count 2307
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 560 place count 1159 transition count 2306
Iterating global reduction 6 with 1 rules applied. Total rules applied 561 place count 1159 transition count 2306
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 1158 transition count 2305
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 1158 transition count 2305
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 737 place count 1071 transition count 2218
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 743 place count 1065 transition count 2212
Iterating global reduction 6 with 6 rules applied. Total rules applied 749 place count 1065 transition count 2212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 754 place count 1065 transition count 2207
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 764 place count 1065 transition count 2197
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 779 place count 1055 transition count 2192
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 780 place count 1055 transition count 2191
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 8 with 37 rules applied. Total rules applied 817 place count 1055 transition count 2154
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 855 place count 1017 transition count 2154
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 857 place count 1017 transition count 2152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 858 place count 1017 transition count 2151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 859 place count 1016 transition count 2151
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 885 place count 1016 transition count 2151
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 886 place count 1016 transition count 2151
Applied a total of 886 rules in 1159 ms. Remains 1016 /1449 variables (removed 433) and now considering 2151/2577 (removed 426) transitions.
// Phase 1: matrix 2151 rows 1016 cols
[2023-03-13 02:16:22] [INFO ] Computed 156 place invariants in 50 ms
[2023-03-13 02:16:22] [INFO ] Implicit Places using invariants in 970 ms returned [73, 91, 97, 100, 102, 105, 106, 158, 176, 182, 184, 190, 195, 196, 248, 265, 276, 278, 279, 284, 285, 354, 360, 367, 370, 377, 378, 450, 456, 459, 461, 464, 471, 472, 527, 545, 556, 563, 568, 569, 621, 640, 646, 649, 651, 652, 659, 729, 735, 747, 827, 834, 837, 839, 842, 850, 851, 904, 922, 929, 932, 934, 935, 1014]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 974 ms to find 64 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 952/1552 places, 2151/2577 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 2149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 950 transition count 2149
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 28 place count 926 transition count 2125
Iterating global reduction 2 with 24 rules applied. Total rules applied 52 place count 926 transition count 2125
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 919 transition count 2118
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 919 transition count 2118
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 98 place count 903 transition count 2102
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 903 transition count 2099
Free-agglomeration rule applied 25 times.
Iterating global reduction 2 with 25 rules applied. Total rules applied 126 place count 903 transition count 2074
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 151 place count 878 transition count 2074
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 156 place count 878 transition count 2069
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 161 place count 873 transition count 2069
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 873 transition count 2069
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 873 transition count 2069
Applied a total of 164 rules in 251 ms. Remains 873 /952 variables (removed 79) and now considering 2069/2151 (removed 82) transitions.
// Phase 1: matrix 2069 rows 873 cols
[2023-03-13 02:16:23] [INFO ] Computed 92 place invariants in 40 ms
[2023-03-13 02:16:23] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-03-13 02:16:23] [INFO ] Invariant cache hit.
[2023-03-13 02:16:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-13 02:16:27] [INFO ] Implicit Places using invariants and state equation in 3260 ms returned []
Implicit Place search using SMT with State Equation took 3909 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 873/1552 places, 2069/2577 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7929 ms. Remains : 873/1552 places, 2069/2577 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 125601 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125601 steps, saw 44609 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 02:16:30] [INFO ] Invariant cache hit.
[2023-03-13 02:16:30] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-13 02:16:30] [INFO ] [Real]Absence check using 19 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-13 02:16:30] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 02:16:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-13 02:16:31] [INFO ] [Nat]Absence check using 19 positive and 73 generalized place invariants in 60 ms returned sat
[2023-03-13 02:16:53] [INFO ] After 21653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 02:16:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-13 02:16:56] [INFO ] After 2937ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 02:16:56] [INFO ] After 2951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 02:16:56] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 138 ms.
Support contains 46 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 2069/2069 transitions.
Applied a total of 0 rules in 27 ms. Remains 873 /873 variables (removed 0) and now considering 2069/2069 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 873/873 places, 2069/2069 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 2069/2069 transitions.
Applied a total of 0 rules in 26 ms. Remains 873 /873 variables (removed 0) and now considering 2069/2069 (removed 0) transitions.
[2023-03-13 02:16:56] [INFO ] Invariant cache hit.
[2023-03-13 02:16:57] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2023-03-13 02:16:57] [INFO ] Invariant cache hit.
[2023-03-13 02:16:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-13 02:17:01] [INFO ] Implicit Places using invariants and state equation in 3698 ms returned []
Implicit Place search using SMT with State Equation took 4978 ms to find 0 implicit places.
[2023-03-13 02:17:01] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-13 02:17:01] [INFO ] Invariant cache hit.
[2023-03-13 02:17:02] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6238 ms. Remains : 873/873 places, 2069/2069 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 873 transition count 2063
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 867 transition count 2063
Applied a total of 12 rules in 39 ms. Remains 867 /873 variables (removed 6) and now considering 2063/2069 (removed 6) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 2063 rows 867 cols
[2023-03-13 02:17:02] [INFO ] Computed 92 place invariants in 16 ms
[2023-03-13 02:17:02] [INFO ] [Real]Absence check using 21 positive place invariants in 33 ms returned sat
[2023-03-13 02:17:02] [INFO ] [Real]Absence check using 21 positive and 71 generalized place invariants in 50 ms returned sat
[2023-03-13 02:17:02] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 02:17:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 54 ms returned sat
[2023-03-13 02:17:03] [INFO ] [Nat]Absence check using 21 positive and 71 generalized place invariants in 77 ms returned sat
[2023-03-13 02:17:27] [INFO ] After 24239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 02:17:32] [INFO ] After 28889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7496 ms.
[2023-03-13 02:17:39] [INFO ] After 36902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 02:17:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-13 02:17:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 873 places, 2069 transitions and 8425 arcs took 10 ms.
[2023-03-13 02:17:40] [INFO ] Flatten gal took : 253 ms
Total runtime 167025 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_10a
(NrP: 873 NrTr: 2069 NrArc: 8425)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.136sec

net check time: 0m 0.001sec

init dd package: 0m 2.870sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9344072 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099424 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.018sec

34037 43450 42266 75993 97108 144192 150424 185746 222268

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="ASLink-PT-10a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ASLink-PT-10a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598700158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;