Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716900303.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 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 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 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 512K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679438666510

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:44:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:44:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:44:29] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-21 22:44:29] [INFO ] Transformed 2103 places.
[2023-03-21 22:44:29] [INFO ] Transformed 1953 transitions.
[2023-03-21 22:44:29] [INFO ] Found NUPN structural information;
[2023-03-21 22:44:29] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-21 22:44:30] [INFO ] Computed 271 place invariants in 24 ms
[2023-03-21 22:44:31] [INFO ] After 978ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 22:44:32] [INFO ] [Nat]Absence check using 271 positive place invariants in 613 ms returned sat
[2023-03-21 22:44:36] [INFO ] After 3247ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-21 22:44:37] [INFO ] Deduced a trap composed of 20 places in 966 ms of which 20 ms to minimize.
[2023-03-21 22:44:38] [INFO ] Deduced a trap composed of 26 places in 622 ms of which 2 ms to minimize.
[2023-03-21 22:44:39] [INFO ] Deduced a trap composed of 23 places in 795 ms of which 2 ms to minimize.
[2023-03-21 22:44:39] [INFO ] Deduced a trap composed of 13 places in 669 ms of which 2 ms to minimize.
[2023-03-21 22:44:40] [INFO ] Deduced a trap composed of 26 places in 654 ms of which 4 ms to minimize.
[2023-03-21 22:44:41] [INFO ] Deduced a trap composed of 32 places in 542 ms of which 2 ms to minimize.
[2023-03-21 22:44:41] [INFO ] Deduced a trap composed of 22 places in 622 ms of which 1 ms to minimize.
[2023-03-21 22:44:42] [INFO ] Deduced a trap composed of 43 places in 461 ms of which 1 ms to minimize.
[2023-03-21 22:44:43] [INFO ] Deduced a trap composed of 37 places in 548 ms of which 1 ms to minimize.
[2023-03-21 22:44:43] [INFO ] Deduced a trap composed of 19 places in 732 ms of which 1 ms to minimize.
[2023-03-21 22:44:44] [INFO ] Deduced a trap composed of 18 places in 657 ms of which 1 ms to minimize.
[2023-03-21 22:44:45] [INFO ] Deduced a trap composed of 28 places in 573 ms of which 2 ms to minimize.
[2023-03-21 22:44:45] [INFO ] Deduced a trap composed of 16 places in 451 ms of which 3 ms to minimize.
[2023-03-21 22:44:46] [INFO ] Deduced a trap composed of 27 places in 528 ms of which 1 ms to minimize.
[2023-03-21 22:44:47] [INFO ] Deduced a trap composed of 25 places in 580 ms of which 1 ms to minimize.
[2023-03-21 22:44:47] [INFO ] Deduced a trap composed of 22 places in 528 ms of which 1 ms to minimize.
[2023-03-21 22:44:48] [INFO ] Deduced a trap composed of 25 places in 485 ms of which 1 ms to minimize.
[2023-03-21 22:44:48] [INFO ] Deduced a trap composed of 21 places in 567 ms of which 1 ms to minimize.
[2023-03-21 22:44:49] [INFO ] Deduced a trap composed of 17 places in 474 ms of which 1 ms to minimize.
[2023-03-21 22:44:49] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 1 ms to minimize.
[2023-03-21 22:44:50] [INFO ] Deduced a trap composed of 39 places in 391 ms of which 1 ms to minimize.
[2023-03-21 22:44:50] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 1 ms to minimize.
[2023-03-21 22:44:51] [INFO ] Deduced a trap composed of 29 places in 573 ms of which 2 ms to minimize.
[2023-03-21 22:44:52] [INFO ] Deduced a trap composed of 25 places in 537 ms of which 1 ms to minimize.
[2023-03-21 22:44:52] [INFO ] Deduced a trap composed of 28 places in 406 ms of which 1 ms to minimize.
[2023-03-21 22:44:53] [INFO ] Deduced a trap composed of 24 places in 831 ms of which 2 ms to minimize.
[2023-03-21 22:44:54] [INFO ] Deduced a trap composed of 27 places in 476 ms of which 2 ms to minimize.
[2023-03-21 22:44:54] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 1 ms to minimize.
[2023-03-21 22:44:55] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 1 ms to minimize.
[2023-03-21 22:44:55] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 1 ms to minimize.
[2023-03-21 22:44:56] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2023-03-21 22:44:56] [INFO ] Deduced a trap composed of 25 places in 519 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:44:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:44:56] [INFO ] After 25486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 497 ms.
Support contains 74 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 2103 transition count 1504
Reduce places removed 449 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 451 rules applied. Total rules applied 900 place count 1654 transition count 1502
Reduce places removed 1 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 26 rules applied. Total rules applied 926 place count 1653 transition count 1477
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 951 place count 1628 transition count 1477
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 124 Pre rules applied. Total rules applied 951 place count 1628 transition count 1353
Deduced a syphon composed of 124 places in 2 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 1199 place count 1504 transition count 1353
Discarding 202 places :
Symmetric choice reduction at 4 with 202 rule applications. Total rules 1401 place count 1302 transition count 1151
Iterating global reduction 4 with 202 rules applied. Total rules applied 1603 place count 1302 transition count 1151
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 1603 place count 1302 transition count 1076
Deduced a syphon composed of 75 places in 4 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 1753 place count 1227 transition count 1076
Performed 471 Post agglomeration using F-continuation condition.Transition count delta: 471
Deduced a syphon composed of 471 places in 2 ms
Reduce places removed 471 places and 0 transitions.
Iterating global reduction 4 with 942 rules applied. Total rules applied 2695 place count 756 transition count 605
Renaming transitions due to excessive name length > 1024 char.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 2837 place count 685 transition count 639
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2843 place count 685 transition count 633
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2849 place count 679 transition count 633
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 2877 place count 679 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2878 place count 678 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2879 place count 677 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2879 place count 677 transition count 631
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2881 place count 676 transition count 631
Applied a total of 2881 rules in 568 ms. Remains 676 /2103 variables (removed 1427) and now considering 631/1953 (removed 1322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 676/2103 places, 631/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 123677 steps, run timeout after 3003 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123677 steps, saw 82211 distinct states, run finished after 3006 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 631 rows 676 cols
[2023-03-21 22:45:01] [INFO ] Computed 270 place invariants in 3 ms
[2023-03-21 22:45:01] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:45:02] [INFO ] [Nat]Absence check using 270 positive place invariants in 137 ms returned sat
[2023-03-21 22:45:03] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:45:03] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-21 22:45:04] [INFO ] After 1018ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:45:04] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 0 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 17 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1481 ms
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2023-03-21 22:45:07] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-21 22:45:07] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-21 22:45:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 521 ms
[2023-03-21 22:45:07] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-21 22:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-21 22:45:07] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2023-03-21 22:45:08] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 13 ms to minimize.
[2023-03-21 22:45:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2023-03-21 22:45:08] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-21 22:45:08] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-21 22:45:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-03-21 22:45:09] [INFO ] After 5557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 642 ms.
[2023-03-21 22:45:09] [INFO ] After 7801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 160 ms.
Support contains 74 out of 676 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 631/631 transitions.
Applied a total of 0 rules in 22 ms. Remains 676 /676 variables (removed 0) and now considering 631/631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 676/676 places, 631/631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 631/631 transitions.
Applied a total of 0 rules in 22 ms. Remains 676 /676 variables (removed 0) and now considering 631/631 (removed 0) transitions.
[2023-03-21 22:45:09] [INFO ] Invariant cache hit.
[2023-03-21 22:45:10] [INFO ] Implicit Places using invariants in 334 ms returned [661]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 675/676 places, 631/631 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 674 transition count 630
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 674 transition count 630
Applied a total of 2 rules in 31 ms. Remains 674 /675 variables (removed 1) and now considering 630/631 (removed 1) transitions.
// Phase 1: matrix 630 rows 674 cols
[2023-03-21 22:45:10] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-21 22:45:10] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-21 22:45:10] [INFO ] Invariant cache hit.
[2023-03-21 22:45:11] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-21 22:45:12] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 674/676 places, 630/631 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2742 ms. Remains : 674/676 places, 630/631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 9) seen :5
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:45:13] [INFO ] Invariant cache hit.
[2023-03-21 22:45:13] [INFO ] [Real]Absence check using 269 positive place invariants in 64 ms returned sat
[2023-03-21 22:45:13] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:45:13] [INFO ] [Nat]Absence check using 269 positive place invariants in 78 ms returned sat
[2023-03-21 22:45:14] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:45:14] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-21 22:45:14] [INFO ] After 613ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:45:14] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2023-03-21 22:45:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 846 ms
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2023-03-21 22:45:16] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2023-03-21 22:45:16] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-21 22:45:16] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-21 22:45:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 780 ms
[2023-03-21 22:45:16] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 10 ms to minimize.
[2023-03-21 22:45:18] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 1 ms to minimize.
[2023-03-21 22:45:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1387 ms
[2023-03-21 22:45:18] [INFO ] After 4132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 502 ms.
[2023-03-21 22:45:18] [INFO ] After 5528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 186 ms.
Support contains 58 out of 674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 674/674 places, 630/630 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 674 transition count 627
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 671 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 670 transition count 626
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 670 transition count 621
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 665 transition count 621
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 36 place count 656 transition count 612
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 651 transition count 616
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 651 transition count 616
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 650 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 649 transition count 615
Applied a total of 49 rules in 77 ms. Remains 649 /674 variables (removed 25) and now considering 615/630 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 649/674 places, 615/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 144634 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144634 steps, saw 98830 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 615 rows 649 cols
[2023-03-21 22:45:22] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:45:22] [INFO ] [Real]Absence check using 268 positive place invariants in 78 ms returned sat
[2023-03-21 22:45:22] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:45:22] [INFO ] [Nat]Absence check using 268 positive place invariants in 46 ms returned sat
[2023-03-21 22:45:23] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:45:23] [INFO ] State equation strengthened by 170 read => feed constraints.
[2023-03-21 22:45:24] [INFO ] After 681ms SMT Verify possible using 170 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:45:24] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-21 22:45:24] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-21 22:45:24] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-21 22:45:24] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-21 22:45:25] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-21 22:45:25] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-21 22:45:25] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-21 22:45:25] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2023-03-21 22:45:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1327 ms
[2023-03-21 22:45:25] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-21 22:45:26] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-21 22:45:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-21 22:45:26] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-21 22:45:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-21 22:45:26] [INFO ] After 3443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-21 22:45:27] [INFO ] After 4645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 127 ms.
Support contains 58 out of 649 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 615/615 transitions.
Applied a total of 0 rules in 13 ms. Remains 649 /649 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 649/649 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 615/615 transitions.
Applied a total of 0 rules in 11 ms. Remains 649 /649 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2023-03-21 22:45:27] [INFO ] Invariant cache hit.
[2023-03-21 22:45:27] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-21 22:45:27] [INFO ] Invariant cache hit.
[2023-03-21 22:45:28] [INFO ] State equation strengthened by 170 read => feed constraints.
[2023-03-21 22:45:29] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
[2023-03-21 22:45:29] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-21 22:45:29] [INFO ] Invariant cache hit.
[2023-03-21 22:45:29] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2315 ms. Remains : 649/649 places, 615/615 transitions.
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 649 transition count 615
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 649 transition count 612
Applied a total of 100 rules in 31 ms. Remains 649 /649 variables (removed 0) and now considering 612/615 (removed 3) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 612 rows 649 cols
[2023-03-21 22:45:29] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:45:30] [INFO ] [Real]Absence check using 268 positive place invariants in 37 ms returned sat
[2023-03-21 22:45:30] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:45:30] [INFO ] [Nat]Absence check using 268 positive place invariants in 40 ms returned sat
[2023-03-21 22:45:30] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:45:30] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-21 22:45:31] [INFO ] After 382ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 680 ms
[2023-03-21 22:45:32] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-21 22:45:32] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-21 22:45:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2023-03-21 22:45:32] [INFO ] After 1845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 464 ms.
[2023-03-21 22:45:32] [INFO ] After 2907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:45:33] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-21 22:45:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 649 places, 615 transitions and 2907 arcs took 6 ms.
[2023-03-21 22:45:33] [INFO ] Flatten gal took : 95 ms
Total runtime 64501 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/789/inv_0_ --invariant=/tmp/789/inv_1_ --invariant=/tmp/789/inv_2_ --invariant=/tmp/789/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8410076 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096904 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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716900303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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