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.r394-oct2-167903717600166.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 ShieldIIPs-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 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.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 868K 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 ShieldIIPs-PT-100A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679496162218

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=ShieldIIPs-PT-100A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:42:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 14:42:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:42:45] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-22 14:42:45] [INFO ] Transformed 2503 places.
[2023-03-22 14:42:45] [INFO ] Transformed 2403 transitions.
[2023-03-22 14:42:45] [INFO ] Found NUPN structural information;
[2023-03-22 14:42:45] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 14) seen :7
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 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 220 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-22 14:42:47] [INFO ] Computed 901 place invariants in 58 ms
[2023-03-22 14:42:49] [INFO ] [Real]Absence check using 901 positive place invariants in 787 ms returned sat
[2023-03-22 14:42:49] [INFO ] After 2075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 14:42:51] [INFO ] [Nat]Absence check using 901 positive place invariants in 664 ms returned sat
[2023-03-22 14:43:14] [INFO ] After 22992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 14:43:14] [INFO ] After 23027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 14:43:14] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 2866 ms.
Support contains 91 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 37 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 645 times.
Drop transitions removed 645 transitions
Iterating global reduction 0 with 645 rules applied. Total rules applied 649 place count 2501 transition count 2401
Applied a total of 649 rules in 625 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 7) seen :1
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-22 14:43:19] [INFO ] Computed 901 place invariants in 101 ms
[2023-03-22 14:43:20] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 14:43:22] [INFO ] [Nat]Absence check using 886 positive place invariants in 306 ms returned sat
[2023-03-22 14:43:22] [INFO ] [Nat]Absence check using 886 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 14:43:45] [INFO ] After 23331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:43:45] [INFO ] State equation strengthened by 4 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-22 14:43:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:43:45] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 391 ms.
Support contains 89 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 46245 steps, run timeout after 3002 ms. (steps per millisecond=15 ) properties seen :{0=1}
Probabilistic random walk after 46245 steps, saw 44006 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :1
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-22 14:43:50] [INFO ] Invariant cache hit.
[2023-03-22 14:43:51] [INFO ] [Real]Absence check using 886 positive place invariants in 235 ms returned sat
[2023-03-22 14:43:51] [INFO ] [Real]Absence check using 886 positive and 15 generalized place invariants in 80 ms returned sat
[2023-03-22 14:43:51] [INFO ] After 1241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:43:53] [INFO ] [Nat]Absence check using 886 positive place invariants in 470 ms returned sat
[2023-03-22 14:43:53] [INFO ] [Nat]Absence check using 886 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-22 14:44:16] [INFO ] After 23497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 14:44:17] [INFO ] State equation strengthened by 4 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-22 14:44:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:44:17] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 1091 ms.
Support contains 53 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 2501 transition count 2401
Applied a total of 21 rules in 193 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 59136 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59136 steps, saw 56879 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-22 14:44:22] [INFO ] Computed 901 place invariants in 70 ms
[2023-03-22 14:44:23] [INFO ] [Real]Absence check using 891 positive place invariants in 380 ms returned sat
[2023-03-22 14:44:23] [INFO ] [Real]Absence check using 891 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-22 14:44:23] [INFO ] After 1046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:44:24] [INFO ] [Nat]Absence check using 891 positive place invariants in 220 ms returned sat
[2023-03-22 14:44:24] [INFO ] [Nat]Absence check using 891 positive and 10 generalized place invariants in 100 ms returned sat
[2023-03-22 14:44:48] [INFO ] After 23762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:44:48] [INFO ] State equation strengthened by 4 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-22 14:44:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:44:48] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 847 ms.
Support contains 53 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 112 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-22 14:44:49] [INFO ] Invariant cache hit.
[2023-03-22 14:44:51] [INFO ] Implicit Places using invariants in 2407 ms returned []
[2023-03-22 14:44:51] [INFO ] Invariant cache hit.
[2023-03-22 14:44:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:45:00] [INFO ] Implicit Places using invariants and state equation in 8601 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11055 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 107 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11241 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 58947 steps, run timeout after 3002 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58947 steps, saw 56695 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-22 14:45:04] [INFO ] Computed 900 place invariants in 30 ms
[2023-03-22 14:45:05] [INFO ] [Real]Absence check using 890 positive place invariants in 276 ms returned sat
[2023-03-22 14:45:05] [INFO ] [Real]Absence check using 890 positive and 10 generalized place invariants in 7 ms returned sat
[2023-03-22 14:45:05] [INFO ] After 1038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:45:07] [INFO ] [Nat]Absence check using 890 positive place invariants in 359 ms returned sat
[2023-03-22 14:45:07] [INFO ] [Nat]Absence check using 890 positive and 10 generalized place invariants in 75 ms returned sat
[2023-03-22 14:45:30] [INFO ] After 23526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 14:45:30] [INFO ] After 23541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 14:45:30] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 430 ms.
Support contains 53 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 84 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-22 14:45:31] [INFO ] Invariant cache hit.
[2023-03-22 14:45:33] [INFO ] Implicit Places using invariants in 2120 ms returned []
[2023-03-22 14:45:33] [INFO ] Invariant cache hit.
[2023-03-22 14:45:40] [INFO ] Implicit Places using invariants and state equation in 7063 ms returned []
Implicit Place search using SMT with State Equation took 9213 ms to find 0 implicit places.
[2023-03-22 14:45:40] [INFO ] Redundant transitions in 187 ms returned []
[2023-03-22 14:45:40] [INFO ] Invariant cache hit.
[2023-03-22 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 2846 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12363 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 100 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-22 14:45:43] [INFO ] Invariant cache hit.
[2023-03-22 14:45:44] [INFO ] [Real]Absence check using 890 positive place invariants in 220 ms returned sat
[2023-03-22 14:45:45] [INFO ] [Real]Absence check using 890 positive and 10 generalized place invariants in 89 ms returned sat
[2023-03-22 14:45:45] [INFO ] After 1190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:45:46] [INFO ] [Nat]Absence check using 890 positive place invariants in 309 ms returned sat
[2023-03-22 14:45:46] [INFO ] [Nat]Absence check using 890 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-22 14:46:15] [INFO ] After 29472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 14:46:18] [INFO ] Deduced a trap composed of 5 places in 868 ms of which 11 ms to minimize.
[2023-03-22 14:46:19] [INFO ] Deduced a trap composed of 6 places in 382 ms of which 2 ms to minimize.
[2023-03-22 14:46:19] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 1 ms to minimize.
[2023-03-22 14:46:20] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-22 14:46:20] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-22 14:46:21] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:46:21] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 2 ms to minimize.
[2023-03-22 14:46:21] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 0 ms to minimize.
[2023-03-22 14:46:22] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2023-03-22 14:46:22] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2023-03-22 14:46:22] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2023-03-22 14:46:23] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-22 14:46:23] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2023-03-22 14:46:24] [INFO ] Deduced a trap composed of 12 places in 450 ms of which 0 ms to minimize.
[2023-03-22 14:46:24] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2023-03-22 14:46:24] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-22 14:46:25] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 0 ms to minimize.
[2023-03-22 14:46:25] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2023-03-22 14:46:25] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:46:26] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-22 14:46:26] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2023-03-22 14:46:27] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 26 ms to minimize.
[2023-03-22 14:46:32] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 17 ms to minimize.
[2023-03-22 14:46:33] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-22 14:46:33] [INFO ] Deduced a trap composed of 6 places in 444 ms of which 0 ms to minimize.
[2023-03-22 14:46:34] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-22 14:46:35] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2023-03-22 14:46:35] [INFO ] Deduced a trap composed of 5 places in 404 ms of which 1 ms to minimize.
[2023-03-22 14:46:36] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:46:36] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2023-03-22 14:46:36] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-22 14:46:37] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-22 14:46:37] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 0 ms to minimize.
[2023-03-22 14:46:37] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 6 ms to minimize.
[2023-03-22 14:46:37] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-22 14:46:38] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:46:38] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-22 14:46:38] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2023-03-22 14:46:43] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 11 ms to minimize.
[2023-03-22 14:46:43] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-22 14:46:44] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-22 14:46:44] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-22 14:46:44] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2023-03-22 14:46:44] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2023-03-22 14:46:45] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-22 14:46:45] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:46:45] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-22 14:46:46] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-22 14:46:46] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-22 14:46:46] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-22 14:46:46] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2023-03-22 14:46:47] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-22 14:46:47] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-22 14:46:47] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-22 14:46:48] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2023-03-22 14:46:48] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2023-03-22 14:46:48] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-22 14:46:48] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 30777 ms
[2023-03-22 14:46:49] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-22 14:46:49] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2023-03-22 14:46:49] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2023-03-22 14:46:50] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-22 14:46:50] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-22 14:46:50] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2023-03-22 14:46:50] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2023-03-22 14:46:51] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-22 14:46:51] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 15 ms to minimize.
[2023-03-22 14:46:51] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-22 14:46:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2877 ms
[2023-03-22 14:46:51] [INFO ] After 65456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6021 ms.
[2023-03-22 14:46:57] [INFO ] After 72740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 14:46:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-22 14:46:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12212 arcs took 36 ms.
[2023-03-22 14:46:58] [INFO ] Flatten gal took : 377 ms
Total runtime 253409 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: ShieldIIPs_PT_100A
(NrP: 2500 NrTr: 2401 NrArc: 12212)

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

net check time: 0m 0.002sec

init dd package: 0m 3.113sec


before gc: list nodes free: 467127

after gc: idd nodes used:921732, unused:63078268; list nodes free:276824161

before gc: list nodes free: 1827060

after gc: idd nodes used:1211285, unused:62788715; list nodes free:281800134

before gc: list nodes free: 3488291

after gc: idd nodes used:1229469, unused:62770531; list nodes free:281730443

before gc: list nodes free: 4275225

after gc: idd nodes used:1310530, unused:62689470; list nodes free:281365416

before gc: list nodes free: 3464761

after gc: idd nodes used:1342670, unused:62657330; list nodes free:281223921

before gc: list nodes free: 2178364

after gc: idd nodes used:2166344, unused:61833656; list nodes free:277478314
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6181376 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094276 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.031sec

128270 140424 873632 939662 943424 1173335 1273519 1256637 1253841 1252169 1261260 1332946 1313322 1382028 1344378 1374438 1349888 1346900 1348200 2164090 2314224

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="ShieldIIPs-PT-100A"
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 ShieldIIPs-PT-100A, 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 r394-oct2-167903717600166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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