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.r391-oct2-167903715100318.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 lolaxred
Input is ShieldIIPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 686K 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 ShieldIIPt-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679273383294

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:49:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:49:45] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-20 00:49:45] [INFO ] Transformed 2803 places.
[2023-03-20 00:49:45] [INFO ] Transformed 2603 transitions.
[2023-03-20 00:49:45] [INFO ] Found NUPN structural information;
[2023-03-20 00:49:45] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 12) seen :6
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-20 00:49:46] [INFO ] Computed 361 place invariants in 31 ms
[2023-03-20 00:49:47] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:49:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 129 ms returned sat
[2023-03-20 00:49:53] [INFO ] After 4969ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:49:55] [INFO ] Deduced a trap composed of 24 places in 1207 ms of which 33 ms to minimize.
[2023-03-20 00:49:56] [INFO ] Deduced a trap composed of 23 places in 1084 ms of which 2 ms to minimize.
[2023-03-20 00:49:57] [INFO ] Deduced a trap composed of 18 places in 1002 ms of which 9 ms to minimize.
[2023-03-20 00:49:58] [INFO ] Deduced a trap composed of 21 places in 1086 ms of which 27 ms to minimize.
[2023-03-20 00:49:59] [INFO ] Deduced a trap composed of 21 places in 860 ms of which 2 ms to minimize.
[2023-03-20 00:50:00] [INFO ] Deduced a trap composed of 17 places in 812 ms of which 2 ms to minimize.
[2023-03-20 00:50:01] [INFO ] Deduced a trap composed of 18 places in 821 ms of which 14 ms to minimize.
[2023-03-20 00:50:02] [INFO ] Deduced a trap composed of 31 places in 770 ms of which 3 ms to minimize.
[2023-03-20 00:50:03] [INFO ] Deduced a trap composed of 28 places in 806 ms of which 2 ms to minimize.
[2023-03-20 00:50:04] [INFO ] Deduced a trap composed of 23 places in 879 ms of which 2 ms to minimize.
[2023-03-20 00:50:05] [INFO ] Deduced a trap composed of 22 places in 778 ms of which 2 ms to minimize.
[2023-03-20 00:50:06] [INFO ] Deduced a trap composed of 24 places in 793 ms of which 2 ms to minimize.
[2023-03-20 00:50:07] [INFO ] Deduced a trap composed of 30 places in 698 ms of which 2 ms to minimize.
[2023-03-20 00:50:07] [INFO ] Deduced a trap composed of 34 places in 738 ms of which 1 ms to minimize.
[2023-03-20 00:50:08] [INFO ] Deduced a trap composed of 25 places in 671 ms of which 1 ms to minimize.
[2023-03-20 00:50:09] [INFO ] Deduced a trap composed of 22 places in 723 ms of which 1 ms to minimize.
[2023-03-20 00:50:10] [INFO ] Deduced a trap composed of 34 places in 757 ms of which 2 ms to minimize.
[2023-03-20 00:50:11] [INFO ] Deduced a trap composed of 21 places in 704 ms of which 2 ms to minimize.
[2023-03-20 00:50:12] [INFO ] Deduced a trap composed of 40 places in 754 ms of which 3 ms to minimize.
[2023-03-20 00:50:13] [INFO ] Deduced a trap composed of 35 places in 700 ms of which 2 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-20 00:50:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:50:13] [INFO ] After 25487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 790 ms.
Support contains 36 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 654 transitions
Trivial Post-agglo rules discarded 654 transitions
Performed 654 trivial Post agglomeration. Transition count delta: 654
Iterating post reduction 0 with 654 rules applied. Total rules applied 654 place count 2803 transition count 1949
Reduce places removed 654 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 656 rules applied. Total rules applied 1310 place count 2149 transition count 1947
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 1321 place count 2148 transition count 1937
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1331 place count 2138 transition count 1937
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 165 Pre rules applied. Total rules applied 1331 place count 2138 transition count 1772
Deduced a syphon composed of 165 places in 4 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 1661 place count 1973 transition count 1772
Discarding 271 places :
Symmetric choice reduction at 4 with 271 rule applications. Total rules 1932 place count 1702 transition count 1501
Iterating global reduction 4 with 271 rules applied. Total rules applied 2203 place count 1702 transition count 1501
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 113 Pre rules applied. Total rules applied 2203 place count 1702 transition count 1388
Deduced a syphon composed of 113 places in 7 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 2429 place count 1589 transition count 1388
Performed 663 Post agglomeration using F-continuation condition.Transition count delta: 663
Deduced a syphon composed of 663 places in 3 ms
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 4 with 1326 rules applied. Total rules applied 3755 place count 926 transition count 725
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3957 place count 825 transition count 789
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3985 place count 811 transition count 798
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3986 place count 811 transition count 797
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3987 place count 811 transition count 796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3988 place count 810 transition count 796
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 4028 place count 810 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4029 place count 809 transition count 795
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4031 place count 807 transition count 795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4031 place count 807 transition count 794
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4033 place count 806 transition count 794
Applied a total of 4033 rules in 833 ms. Remains 806 /2803 variables (removed 1997) and now considering 794/2603 (removed 1809) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 834 ms. Remains : 806/2803 places, 794/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 111166 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111166 steps, saw 83483 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 794 rows 806 cols
[2023-03-20 00:50:18] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-20 00:50:18] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:50:18] [INFO ] [Nat]Absence check using 359 positive place invariants in 94 ms returned sat
[2023-03-20 00:50:19] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:50:19] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-20 00:50:20] [INFO ] After 187ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:50:20] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-03-20 00:50:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-20 00:50:20] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 16 ms to minimize.
[2023-03-20 00:50:20] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-03-20 00:50:20] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2023-03-20 00:50:21] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-20 00:50:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 587 ms
[2023-03-20 00:50:21] [INFO ] After 1255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-20 00:50:21] [INFO ] After 2840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 115 ms.
Support contains 36 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 794/794 transitions.
Applied a total of 0 rules in 34 ms. Remains 806 /806 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 806/806 places, 794/794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 794/794 transitions.
Applied a total of 0 rules in 31 ms. Remains 806 /806 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2023-03-20 00:50:21] [INFO ] Invariant cache hit.
[2023-03-20 00:50:21] [INFO ] Implicit Places using invariants in 448 ms returned [793]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 450 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 805/806 places, 794/794 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 804 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 804 transition count 793
Applied a total of 2 rules in 56 ms. Remains 804 /805 variables (removed 1) and now considering 793/794 (removed 1) transitions.
// Phase 1: matrix 793 rows 804 cols
[2023-03-20 00:50:22] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:50:22] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-20 00:50:22] [INFO ] Invariant cache hit.
[2023-03-20 00:50:22] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-20 00:50:24] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 804/806 places, 793/794 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2741 ms. Remains : 804/806 places, 793/794 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 115616 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115616 steps, saw 84416 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 00:50:27] [INFO ] Invariant cache hit.
[2023-03-20 00:50:27] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:50:28] [INFO ] [Nat]Absence check using 358 positive place invariants in 102 ms returned sat
[2023-03-20 00:50:28] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:50:28] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-20 00:50:29] [INFO ] After 302ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:50:29] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2023-03-20 00:50:29] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2023-03-20 00:50:29] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-03-20 00:50:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 594 ms
[2023-03-20 00:50:30] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-20 00:50:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-20 00:50:30] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2023-03-20 00:50:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 458 ms
[2023-03-20 00:50:30] [INFO ] After 1919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-20 00:50:31] [INFO ] After 3099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 124 ms.
Support contains 36 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 793/793 transitions.
Applied a total of 0 rules in 19 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 804/804 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 793/793 transitions.
Applied a total of 0 rules in 18 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2023-03-20 00:50:31] [INFO ] Invariant cache hit.
[2023-03-20 00:50:31] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-20 00:50:31] [INFO ] Invariant cache hit.
[2023-03-20 00:50:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-20 00:50:32] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2023-03-20 00:50:32] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-20 00:50:32] [INFO ] Invariant cache hit.
[2023-03-20 00:50:33] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2173 ms. Remains : 804/804 places, 793/793 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 804 transition count 793
Applied a total of 82 rules in 36 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 793 rows 804 cols
[2023-03-20 00:50:33] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:50:33] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:50:33] [INFO ] [Nat]Absence check using 358 positive place invariants in 120 ms returned sat
[2023-03-20 00:50:34] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:50:34] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-20 00:50:34] [INFO ] After 372ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:50:35] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 1 ms to minimize.
[2023-03-20 00:50:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-20 00:50:35] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 14 ms to minimize.
[2023-03-20 00:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-20 00:50:36] [INFO ] After 1473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 356 ms.
[2023-03-20 00:50:36] [INFO ] After 2829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:50:36] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-20 00:50:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 804 places, 793 transitions and 3794 arcs took 11 ms.
[2023-03-20 00:50:36] [INFO ] Flatten gal took : 100 ms
Total runtime 51474 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-040B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality

FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679273437544

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 20 (type EXCL) for 0 ShieldIIPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 0 ShieldIIPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 0 ShieldIIPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 0 ShieldIIPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 19 (type SRCH) for ShieldIIPt-PT-040B-ReachabilityCardinality-00
lola: result : true
lola: markings : 97
lola: fired transitions : 96
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldIIPt-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldIIPt-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ShieldIIPt-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 26 (type EXCL) for 3 ShieldIIPt-PT-040B-ReachabilityCardinality-03
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 3 ShieldIIPt-PT-040B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 3 ShieldIIPt-PT-040B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 3 ShieldIIPt-PT-040B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 22 (type FNDP) for ShieldIIPt-PT-040B-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 37
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 23 (type EQUN) for ShieldIIPt-PT-040B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 25 (type SRCH) for ShieldIIPt-PT-040B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 26 (type EXCL) for ShieldIIPt-PT-040B-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 32 (type EXCL) for 6 ShieldIIPt-PT-040B-ReachabilityCardinality-05
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 6 ShieldIIPt-PT-040B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 6 ShieldIIPt-PT-040B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type SRCH) for 6 ShieldIIPt-PT-040B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type FNDP) for ShieldIIPt-PT-040B-ReachabilityCardinality-00
lola: result : true
lola: fired transitions : 95
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 31 (type SRCH) for ShieldIIPt-PT-040B-ReachabilityCardinality-05
lola: result : true
lola: markings : 56
lola: fired transitions : 55
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 28 (type FNDP) for ShieldIIPt-PT-040B-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 29 (type EQUN) for ShieldIIPt-PT-040B-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 32 (type EXCL) for ShieldIIPt-PT-040B-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 44 (type EXCL) for 9 ShieldIIPt-PT-040B-ReachabilityCardinality-06
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 34 (type FNDP) for 12 ShieldIIPt-PT-040B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 12 ShieldIIPt-PT-040B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type SRCH) for 12 ShieldIIPt-PT-040B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-23.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 28 (type FNDP) for ShieldIIPt-PT-040B-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 54
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-17.sara.
lola: FINISHED task # 37 (type SRCH) for ShieldIIPt-PT-040B-ReachabilityCardinality-12
lola: result : true
lola: markings : 101
lola: fired transitions : 100
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 34 (type FNDP) for ShieldIIPt-PT-040B-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 99
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 35 (type EQUN) for ShieldIIPt-PT-040B-ReachabilityCardinality-12 (obsolete)
lola: LAUNCH task # 40 (type FNDP) for 9 ShieldIIPt-PT-040B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 9 ShieldIIPt-PT-040B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type SRCH) for 9 ShieldIIPt-PT-040B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 40 (type FNDP) for ShieldIIPt-PT-040B-ReachabilityCardinality-06
lola: result : true
lola: fired transitions : 55
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 41 (type EQUN) for ShieldIIPt-PT-040B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 43 (type SRCH) for ShieldIIPt-PT-040B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 44 (type EXCL) for ShieldIIPt-PT-040B-ReachabilityCardinality-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-ReachabilityCardinality-00: AG false tandem / insertion
ShieldIIPt-PT-040B-ReachabilityCardinality-03: EF true findpath
ShieldIIPt-PT-040B-ReachabilityCardinality-05: EF true tandem / insertion
ShieldIIPt-PT-040B-ReachabilityCardinality-06: EF true findpath
ShieldIIPt-PT-040B-ReachabilityCardinality-12: EF true findpath


Time elapsed: 1 secs. Pages in use: 4
lola: rewrite Frontend/Parser/formula_rewrite.k:711

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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldIIPt-PT-040B, 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 r391-oct2-167903715100318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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