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.r453-smll-167912645500518.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyCommit-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645500518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 126M
-rw-r--r-- 1 mcc users 8.4K Feb 26 11:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 11:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 11:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 11:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 11:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 11:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 126M 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 StigmergyCommit-PT-09b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679382449087

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 07:07:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 07:07:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:07:38] [INFO ] Load time of PNML (sax parser for PT used): 6429 ms
[2023-03-21 07:07:39] [INFO ] Transformed 3049 places.
[2023-03-21 07:07:39] [INFO ] Transformed 122340 transitions.
[2023-03-21 07:07:39] [INFO ] Found NUPN structural information;
[2023-03-21 07:07:39] [INFO ] Parsed PT model containing 3049 places and 122340 transitions and 2389246 arcs in 7352 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 2618 ms. (steps per millisecond=3 ) properties (out of 13) seen :4
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 122340 rows 3049 cols
[2023-03-21 07:07:53] [INFO ] Computed 11 place invariants in 7248 ms
[2023-03-21 07:07:55] [INFO ] After 2234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 07:07:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 43 ms returned sat
[2023-03-21 07:08:00] [INFO ] Flatten gal took : 16562 ms
[2023-03-21 07:08:14] [INFO ] Flatten gal took : 13956 ms
[2023-03-21 07:08:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9722666393845724480.gal : 2221 ms
[2023-03-21 07:08:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1736072021362840836.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9722666393845724480.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1736072021362840836.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2023-03-21 07:08:20] [INFO ] After 22945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:08:20] [INFO ] After 23131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-21 07:08:20] [INFO ] After 25262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 126 out of 3049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3049/3049 places, 122340/122340 transitions.
Graph (trivial) has 2786 edges and 3049 vertex of which 174 / 3049 are part of one of the 27 SCC in 34 ms
Free SCC test removed 147 places
Drop transitions removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Graph (complete) has 5443 edges and 2902 vertex of which 2882 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.507 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2030 transitions
Trivial Post-agglo rules discarded 2030 transitions
Performed 2030 trivial Post agglomeration. Transition count delta: 2030
Iterating post reduction 0 with 2040 rules applied. Total rules applied 2042 place count 2882 transition count 120102
Reduce places removed 2030 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 2075 rules applied. Total rules applied 4117 place count 852 transition count 120057
Reduce places removed 18 places and 0 transitions.
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Iterating post reduction 2 with 121 rules applied. Total rules applied 4238 place count 834 transition count 119954
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 104 rules applied. Total rules applied 4342 place count 731 transition count 119953
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 116 Pre rules applied. Total rules applied 4342 place count 731 transition count 119837
Deduced a syphon composed of 116 places in 169 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 4574 place count 615 transition count 119837
Discarding 89 places :
Symmetric choice reduction at 4 with 89 rule applications. Total rules 4663 place count 526 transition count 119748
Iterating global reduction 4 with 89 rules applied. Total rules applied 4752 place count 526 transition count 119748
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4754 place count 526 transition count 119746
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4754 place count 526 transition count 119744
Deduced a syphon composed of 2 places in 134 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4758 place count 524 transition count 119744
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 4796 place count 486 transition count 6086
Iterating global reduction 5 with 38 rules applied. Total rules applied 4834 place count 486 transition count 6086
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 4844 place count 486 transition count 6076
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 4849 place count 481 transition count 6071
Iterating global reduction 6 with 5 rules applied. Total rules applied 4854 place count 481 transition count 6071
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 4859 place count 476 transition count 6066
Iterating global reduction 6 with 5 rules applied. Total rules applied 4864 place count 476 transition count 6066
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4867 place count 476 transition count 6063
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4947 place count 436 transition count 6023
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 4957 place count 426 transition count 6013
Iterating global reduction 7 with 10 rules applied. Total rules applied 4967 place count 426 transition count 6013
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4974 place count 419 transition count 6006
Iterating global reduction 7 with 7 rules applied. Total rules applied 4981 place count 419 transition count 6006
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 4987 place count 413 transition count 6000
Iterating global reduction 7 with 6 rules applied. Total rules applied 4993 place count 413 transition count 6000
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 5005 place count 407 transition count 6019
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 5009 place count 407 transition count 6015
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 5014 place count 407 transition count 6010
Free-agglomeration rule applied 83 times.
Iterating global reduction 8 with 83 rules applied. Total rules applied 5097 place count 407 transition count 5927
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 8 with 83 rules applied. Total rules applied 5180 place count 324 transition count 5927
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 2182 transitions
Redundant transition composition rules discarded 2182 transitions
Iterating global reduction 9 with 2182 rules applied. Total rules applied 7362 place count 324 transition count 3745
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 7365 place count 324 transition count 3742
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 7368 place count 321 transition count 3742
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 7376 place count 321 transition count 3742
Applied a total of 7376 rules in 117501 ms. Remains 321 /3049 variables (removed 2728) and now considering 3742/122340 (removed 118598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119872 ms. Remains : 321/3049 places, 3742/122340 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 1115 ms. (steps per millisecond=8 ) properties (out of 9) seen :5
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3742 rows 321 cols
[2023-03-21 07:10:22] [INFO ] Computed 11 place invariants in 132 ms
[2023-03-21 07:10:27] [INFO ] After 3669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 07:10:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2023-03-21 07:10:31] [INFO ] After 4578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 07:10:33] [INFO ] State equation strengthened by 3000 read => feed constraints.
[2023-03-21 07:10:38] [INFO ] After 5554ms SMT Verify possible using 3000 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 07:11:03] [INFO ] Deduced a trap composed of 54 places in 23523 ms of which 172 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 07:11:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:11:03] [INFO ] After 36210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 78 ms.
Support contains 72 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 3742/3742 transitions.
Graph (trivial) has 121 edges and 321 vertex of which 8 / 321 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 317 transition count 3691
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 94 place count 274 transition count 3684
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 270 transition count 3683
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 99 place count 270 transition count 3676
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 113 place count 263 transition count 3676
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 119 place count 257 transition count 3670
Iterating global reduction 3 with 6 rules applied. Total rules applied 125 place count 257 transition count 3670
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 255 transition count 3668
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 255 transition count 3668
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 138 place count 255 transition count 3659
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 166 place count 241 transition count 3644
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 170 place count 241 transition count 3640
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 188 place count 223 transition count 3622
Iterating global reduction 5 with 18 rules applied. Total rules applied 206 place count 223 transition count 3622
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 213 place count 216 transition count 3615
Iterating global reduction 5 with 7 rules applied. Total rules applied 220 place count 216 transition count 3615
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 227 place count 216 transition count 3608
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 229 place count 214 transition count 3606
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 214 transition count 3606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 214 transition count 3605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 234 place count 213 transition count 3615
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 248 place count 213 transition count 3601
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 261 place count 213 transition count 3588
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 275 place count 200 transition count 3587
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 278 place count 200 transition count 3584
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 281 place count 200 transition count 3584
Applied a total of 281 rules in 8723 ms. Remains 200 /321 variables (removed 121) and now considering 3584/3742 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8723 ms. Remains : 200/321 places, 3584/3742 transitions.
Incomplete random walk after 10000 steps, including 218 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 144812 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144812 steps, saw 25683 distinct states, run finished after 3016 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3584 rows 200 cols
[2023-03-21 07:11:16] [INFO ] Computed 11 place invariants in 103 ms
[2023-03-21 07:11:16] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 07:11:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-21 07:11:20] [INFO ] After 3136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 07:11:21] [INFO ] State equation strengthened by 3329 read => feed constraints.
[2023-03-21 07:11:25] [INFO ] After 4461ms SMT Verify possible using 3329 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 07:11:33] [INFO ] Deduced a trap composed of 25 places in 3914 ms of which 2 ms to minimize.
[2023-03-21 07:11:38] [INFO ] Deduced a trap composed of 22 places in 4730 ms of which 3 ms to minimize.
[2023-03-21 07:11:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 11857 ms
[2023-03-21 07:11:41] [INFO ] Deduced a trap composed of 25 places in 2245 ms of which 2 ms to minimize.
[2023-03-21 07:11:44] [INFO ] Deduced a trap composed of 26 places in 3422 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-21 07:11:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:11:44] [INFO ] After 27889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 43 ms.
Support contains 7 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 3584/3584 transitions.
Graph (trivial) has 137 edges and 200 vertex of which 4 / 200 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 198 transition count 3519
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 128 place count 137 transition count 3514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 136 transition count 3514
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 129 place count 136 transition count 3510
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 132 transition count 3510
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 150 place count 119 transition count 3497
Iterating global reduction 3 with 13 rules applied. Total rules applied 163 place count 119 transition count 3497
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 169 place count 113 transition count 3491
Iterating global reduction 3 with 6 rules applied. Total rules applied 175 place count 113 transition count 3491
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 30 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 199 place count 101 transition count 3479
Ensure Unique test removed 770 transitions
Reduce isomorphic transitions removed 770 transitions.
Iterating post reduction 3 with 770 rules applied. Total rules applied 969 place count 101 transition count 2709
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 982 place count 88 transition count 2696
Iterating global reduction 4 with 13 rules applied. Total rules applied 995 place count 88 transition count 2696
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1002 place count 81 transition count 2689
Iterating global reduction 4 with 7 rules applied. Total rules applied 1009 place count 81 transition count 2689
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1013 place count 81 transition count 2685
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1014 place count 80 transition count 2684
Iterating global reduction 5 with 1 rules applied. Total rules applied 1015 place count 80 transition count 2684
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1023 place count 80 transition count 2676
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1028 place count 80 transition count 2671
Free-agglomeration rule applied 15 times with reduction of 512 identical transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 1043 place count 80 transition count 2144
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 6 with 273 rules applied. Total rules applied 1316 place count 65 transition count 1886
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1317 place count 64 transition count 1884
Iterating global reduction 7 with 1 rules applied. Total rules applied 1318 place count 64 transition count 1884
Drop transitions removed 255 transitions
Redundant transition composition rules discarded 255 transitions
Iterating global reduction 7 with 255 rules applied. Total rules applied 1573 place count 64 transition count 1629
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1575 place count 64 transition count 1627
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1579 place count 62 transition count 1625
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1581 place count 60 transition count 1621
Iterating global reduction 8 with 2 rules applied. Total rules applied 1583 place count 60 transition count 1621
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1585 place count 60 transition count 1621
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1587 place count 60 transition count 1619
Applied a total of 1587 rules in 57303 ms. Remains 60 /200 variables (removed 140) and now considering 1619/3584 (removed 1965) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57304 ms. Remains : 60/200 places, 1619/3584 transitions.
Incomplete random walk after 10000 steps, including 343 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 441002 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{0=1}
Probabilistic random walk after 441002 steps, saw 61864 distinct states, run finished after 3011 ms. (steps per millisecond=146 ) properties seen :1
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1619 rows 60 cols
[2023-03-21 07:12:45] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-21 07:12:46] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:12:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 55 ms returned sat
[2023-03-21 07:12:47] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:12:47] [INFO ] State equation strengthened by 1574 read => feed constraints.
[2023-03-21 07:12:48] [INFO ] After 417ms SMT Verify possible using 1574 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:12:49] [INFO ] Deduced a trap composed of 13 places in 968 ms of which 10 ms to minimize.
[2023-03-21 07:12:50] [INFO ] Deduced a trap composed of 11 places in 834 ms of which 1 ms to minimize.
[2023-03-21 07:12:51] [INFO ] Deduced a trap composed of 11 places in 750 ms of which 1 ms to minimize.
[2023-03-21 07:12:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 2743 ms
[2023-03-21 07:12:51] [INFO ] After 3174ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-21 07:12:51] [INFO ] After 4780ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 318807 ms.

BK_STOP 1679382775160

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="StigmergyCommit-PT-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyCommit-PT-09b, 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 r453-smll-167912645500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09b.tgz
mv StigmergyCommit-PT-09b 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 ;