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.r393-oct2-167903717100526.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 ltsminxred
Input is ShieldPPPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 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 ShieldPPPs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679459106134

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:25:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:25:08] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2023-03-22 04:25:09] [INFO ] Transformed 6803 places.
[2023-03-22 04:25:09] [INFO ] Transformed 6303 transitions.
[2023-03-22 04:25:09] [INFO ] Found NUPN structural information;
[2023-03-22 04:25:09] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 679 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 775 ms. (steps per millisecond=12 ) properties (out of 13) seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-22 04:25:10] [INFO ] Computed 1101 place invariants in 65 ms
[2023-03-22 04:25:13] [INFO ] After 2633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 04:25:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 876 ms returned sat
[2023-03-22 04:25:28] [INFO ] After 10084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 04:25:32] [INFO ] Deduced a trap composed of 23 places in 3620 ms of which 21 ms to minimize.
[2023-03-22 04:25:35] [INFO ] Deduced a trap composed of 11 places in 3117 ms of which 8 ms to minimize.
[2023-03-22 04:25:39] [INFO ] Deduced a trap composed of 24 places in 3542 ms of which 31 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-22 04:25:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:25:39] [INFO ] After 26219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3040 ms.
Support contains 56 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 684 rules applied. Total rules applied 684 place count 6803 transition count 5619
Reduce places removed 684 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 694 rules applied. Total rules applied 1378 place count 6119 transition count 5609
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1388 place count 6109 transition count 5609
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1388 place count 6109 transition count 5109
Deduced a syphon composed of 500 places in 69 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2388 place count 5609 transition count 5109
Discarding 684 places :
Symmetric choice reduction at 3 with 684 rule applications. Total rules 3072 place count 4925 transition count 4425
Iterating global reduction 3 with 684 rules applied. Total rules applied 3756 place count 4925 transition count 4425
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 3756 place count 4925 transition count 4139
Deduced a syphon composed of 286 places in 28 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 3 with 572 rules applied. Total rules applied 4328 place count 4639 transition count 4139
Performed 1484 Post agglomeration using F-continuation condition.Transition count delta: 1484
Deduced a syphon composed of 1484 places in 7 ms
Reduce places removed 1484 places and 0 transitions.
Iterating global reduction 3 with 2968 rules applied. Total rules applied 7296 place count 3155 transition count 2655
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 880 times.
Drop transitions removed 880 transitions
Iterating global reduction 3 with 880 rules applied. Total rules applied 8176 place count 3155 transition count 2655
Applied a total of 8176 rules in 2734 ms. Remains 3155 /6803 variables (removed 3648) and now considering 2655/6303 (removed 3648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2735 ms. Remains : 3155/6803 places, 2655/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 10) seen :3
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2655 rows 3155 cols
[2023-03-22 04:25:46] [INFO ] Computed 1101 place invariants in 134 ms
[2023-03-22 04:25:47] [INFO ] After 864ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:25:48] [INFO ] [Nat]Absence check using 1041 positive place invariants in 285 ms returned sat
[2023-03-22 04:25:48] [INFO ] [Nat]Absence check using 1041 positive and 60 generalized place invariants in 22 ms returned sat
[2023-03-22 04:26:02] [INFO ] After 12966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 04:26:02] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 2 ms to minimize.
[2023-03-22 04:26:03] [INFO ] Deduced a trap composed of 9 places in 383 ms of which 1 ms to minimize.
[2023-03-22 04:26:03] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 1 ms to minimize.
[2023-03-22 04:26:04] [INFO ] Deduced a trap composed of 6 places in 459 ms of which 1 ms to minimize.
[2023-03-22 04:26:05] [INFO ] Deduced a trap composed of 13 places in 454 ms of which 1 ms to minimize.
[2023-03-22 04:26:05] [INFO ] Deduced a trap composed of 9 places in 369 ms of which 1 ms to minimize.
[2023-03-22 04:26:06] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2023-03-22 04:26:06] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2023-03-22 04:26:07] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 1 ms to minimize.
[2023-03-22 04:26:07] [INFO ] Deduced a trap composed of 8 places in 404 ms of which 1 ms to minimize.
[2023-03-22 04:26:07] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 1 ms to minimize.
[2023-03-22 04:26:08] [INFO ] Deduced a trap composed of 9 places in 354 ms of which 2 ms to minimize.
[2023-03-22 04:26:09] [INFO ] Deduced a trap composed of 9 places in 458 ms of which 1 ms to minimize.
[2023-03-22 04:26:09] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 0 ms to minimize.
[2023-03-22 04:26:10] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 1 ms to minimize.
[2023-03-22 04:26:10] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-22 04:26:11] [INFO ] Deduced a trap composed of 9 places in 352 ms of which 6 ms to minimize.
[2023-03-22 04:26:11] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 0 ms to minimize.
[2023-03-22 04:26:11] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2023-03-22 04:26:12] [INFO ] Deduced a trap composed of 6 places in 584 ms of which 3 ms to minimize.
[2023-03-22 04:26:15] [INFO ] Deduced a trap composed of 3 places in 3122 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-22 04:26:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:26:15] [INFO ] After 28141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1155 ms.
Support contains 49 out of 3155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3155/3155 places, 2655/2655 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 3151 transition count 2651
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 3150 transition count 2650
Applied a total of 9 rules in 541 ms. Remains 3150 /3155 variables (removed 5) and now considering 2650/2655 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 541 ms. Remains : 3150/3155 places, 2650/2655 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 54131 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54131 steps, saw 51428 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2650 rows 3150 cols
[2023-03-22 04:26:21] [INFO ] Computed 1101 place invariants in 42 ms
[2023-03-22 04:26:22] [INFO ] After 938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:26:23] [INFO ] [Nat]Absence check using 1055 positive place invariants in 259 ms returned sat
[2023-03-22 04:26:23] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-22 04:26:36] [INFO ] After 12554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 04:26:37] [INFO ] Deduced a trap composed of 6 places in 615 ms of which 1 ms to minimize.
[2023-03-22 04:26:38] [INFO ] Deduced a trap composed of 8 places in 789 ms of which 1 ms to minimize.
[2023-03-22 04:26:39] [INFO ] Deduced a trap composed of 4 places in 1023 ms of which 2 ms to minimize.
[2023-03-22 04:26:40] [INFO ] Deduced a trap composed of 9 places in 577 ms of which 1 ms to minimize.
[2023-03-22 04:26:41] [INFO ] Deduced a trap composed of 5 places in 685 ms of which 1 ms to minimize.
[2023-03-22 04:26:41] [INFO ] Deduced a trap composed of 7 places in 644 ms of which 1 ms to minimize.
[2023-03-22 04:26:42] [INFO ] Deduced a trap composed of 6 places in 831 ms of which 2 ms to minimize.
[2023-03-22 04:26:43] [INFO ] Deduced a trap composed of 10 places in 611 ms of which 2 ms to minimize.
[2023-03-22 04:26:44] [INFO ] Deduced a trap composed of 13 places in 571 ms of which 1 ms to minimize.
[2023-03-22 04:26:44] [INFO ] Deduced a trap composed of 7 places in 459 ms of which 1 ms to minimize.
[2023-03-22 04:26:45] [INFO ] Deduced a trap composed of 7 places in 448 ms of which 1 ms to minimize.
[2023-03-22 04:26:45] [INFO ] Deduced a trap composed of 7 places in 457 ms of which 1 ms to minimize.
[2023-03-22 04:26:46] [INFO ] Deduced a trap composed of 8 places in 397 ms of which 1 ms to minimize.
[2023-03-22 04:26:47] [INFO ] Deduced a trap composed of 10 places in 482 ms of which 1 ms to minimize.
[2023-03-22 04:26:47] [INFO ] Deduced a trap composed of 7 places in 578 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-22 04:26:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:26:47] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1108 ms.
Support contains 49 out of 3150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 180 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 3150/3150 places, 2650/2650 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 170 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
[2023-03-22 04:26:49] [INFO ] Invariant cache hit.
[2023-03-22 04:26:52] [INFO ] Implicit Places using invariants in 3057 ms returned []
[2023-03-22 04:26:52] [INFO ] Invariant cache hit.
[2023-03-22 04:26:59] [INFO ] Implicit Places using invariants and state equation in 6863 ms returned []
Implicit Place search using SMT with State Equation took 9954 ms to find 0 implicit places.
[2023-03-22 04:26:59] [INFO ] Redundant transitions in 161 ms returned []
[2023-03-22 04:26:59] [INFO ] Invariant cache hit.
[2023-03-22 04:27:01] [INFO ] Dead Transitions using invariants and state equation in 1932 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12238 ms. Remains : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 175 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-22 04:27:01] [INFO ] Invariant cache hit.
[2023-03-22 04:27:02] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:27:03] [INFO ] [Nat]Absence check using 1055 positive place invariants in 287 ms returned sat
[2023-03-22 04:27:03] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 11 ms returned sat
[2023-03-22 04:27:15] [INFO ] After 12196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 04:27:16] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2023-03-22 04:27:16] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 1 ms to minimize.
[2023-03-22 04:27:17] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2023-03-22 04:27:17] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 19 ms to minimize.
[2023-03-22 04:27:18] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-22 04:27:18] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 0 ms to minimize.
[2023-03-22 04:27:19] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 2 ms to minimize.
[2023-03-22 04:27:19] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2023-03-22 04:27:20] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 1 ms to minimize.
[2023-03-22 04:27:20] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 1 ms to minimize.
[2023-03-22 04:27:21] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2023-03-22 04:27:21] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2023-03-22 04:27:21] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 0 ms to minimize.
[2023-03-22 04:27:22] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-22 04:27:22] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 0 ms to minimize.
[2023-03-22 04:27:23] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 1 ms to minimize.
[2023-03-22 04:27:23] [INFO ] Deduced a trap composed of 8 places in 365 ms of which 13 ms to minimize.
[2023-03-22 04:27:23] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 1 ms to minimize.
[2023-03-22 04:27:24] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2023-03-22 04:27:24] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-22 04:27:25] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-22 04:27:25] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 0 ms to minimize.
[2023-03-22 04:27:25] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2023-03-22 04:27:26] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 7 ms to minimize.
[2023-03-22 04:27:26] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-22 04:27:26] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 2 ms to minimize.
[2023-03-22 04:27:27] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 1 ms to minimize.
[2023-03-22 04:27:27] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 1 ms to minimize.
[2023-03-22 04:27:27] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 14 ms to minimize.
[2023-03-22 04:27:28] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 2 ms to minimize.
[2023-03-22 04:27:28] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2023-03-22 04:27:28] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2023-03-22 04:27:29] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 0 ms to minimize.
[2023-03-22 04:27:29] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2023-03-22 04:27:30] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2023-03-22 04:27:31] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 1 ms to minimize.
[2023-03-22 04:27:31] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 0 ms to minimize.
[2023-03-22 04:27:31] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2023-03-22 04:27:32] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 4 ms to minimize.
[2023-03-22 04:27:32] [INFO ] Deduced a trap composed of 25 places in 352 ms of which 1 ms to minimize.
[2023-03-22 04:27:33] [INFO ] Deduced a trap composed of 17 places in 299 ms of which 0 ms to minimize.
[2023-03-22 04:27:33] [INFO ] Deduced a trap composed of 27 places in 401 ms of which 0 ms to minimize.
[2023-03-22 04:27:34] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 1 ms to minimize.
[2023-03-22 04:27:34] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 0 ms to minimize.
[2023-03-22 04:27:34] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-22 04:27:34] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-22 04:27:35] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2023-03-22 04:27:35] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 0 ms to minimize.
[2023-03-22 04:27:36] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 1 ms to minimize.
[2023-03-22 04:27:36] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-22 04:27:36] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 0 ms to minimize.
[2023-03-22 04:27:37] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 0 ms to minimize.
[2023-03-22 04:27:37] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 1 ms to minimize.
[2023-03-22 04:27:37] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-22 04:27:38] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-22 04:27:38] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-22 04:27:38] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-22 04:27:38] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2023-03-22 04:27:38] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2023-03-22 04:27:39] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-22 04:27:39] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2023-03-22 04:27:39] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-22 04:27:40] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 0 ms to minimize.
[2023-03-22 04:27:40] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 0 ms to minimize.
[2023-03-22 04:27:41] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-22 04:27:41] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 25270 ms
[2023-03-22 04:27:41] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-22 04:27:41] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-22 04:27:42] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2023-03-22 04:27:42] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-22 04:27:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1137 ms
[2023-03-22 04:27:43] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-22 04:27:43] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-22 04:27:43] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2023-03-22 04:27:44] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 0 ms to minimize.
[2023-03-22 04:27:44] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 04:27:44] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2023-03-22 04:27:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2100 ms
[2023-03-22 04:27:45] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2023-03-22 04:27:46] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2023-03-22 04:27:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 802 ms
[2023-03-22 04:27:46] [INFO ] After 42636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 928 ms.
[2023-03-22 04:27:47] [INFO ] After 45072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 04:27:47] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-22 04:27:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3150 places, 2650 transitions and 12326 arcs took 20 ms.
[2023-03-22 04:27:47] [INFO ] Flatten gal took : 329 ms
Total runtime 159337 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/870/inv_0_ --invariant=/tmp/870/inv_1_ --invariant=/tmp/870/inv_2_ --invariant=/tmp/870/inv_3_ --invariant=/tmp/870/inv_4_ --invariant=/tmp/870/inv_5_ --invariant=/tmp/870/inv_6_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 149696 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16301912 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
mcc2023

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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-PT-100B, 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 r393-oct2-167903717100526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100B.tgz
mv ShieldPPPs-PT-100B 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 ;