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.r458-smll-167912650300454.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 marciexred
Input is StigmergyCommit-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650300454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 10:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 10:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 10:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 10:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:53 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 1.4M 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-05b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679461058922

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 04:57:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:57:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:57:41] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2023-03-22 04:57:41] [INFO ] Transformed 1837 places.
[2023-03-22 04:57:41] [INFO ] Transformed 3460 transitions.
[2023-03-22 04:57:41] [INFO ] Found NUPN structural information;
[2023-03-22 04:57:41] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 593 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 89 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 13) seen :2
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 3460 rows 1837 cols
[2023-03-22 04:57:44] [INFO ] Computed 7 place invariants in 110 ms
[2023-03-22 04:57:46] [INFO ] After 1397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 04:57:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 23 ms returned sat
[2023-03-22 04:57:53] [INFO ] After 5514ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-22 04:57:55] [INFO ] Deduced a trap composed of 488 places in 1780 ms of which 16 ms to minimize.
[2023-03-22 04:57:57] [INFO ] Deduced a trap composed of 396 places in 2132 ms of which 1 ms to minimize.
[2023-03-22 04:57:58] [INFO ] Deduced a trap composed of 397 places in 1194 ms of which 2 ms to minimize.
[2023-03-22 04:58:00] [INFO ] Deduced a trap composed of 396 places in 1314 ms of which 2 ms to minimize.
[2023-03-22 04:58:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7215 ms
[2023-03-22 04:58:03] [INFO ] Deduced a trap composed of 399 places in 1950 ms of which 2 ms to minimize.
[2023-03-22 04:58:05] [INFO ] Deduced a trap composed of 396 places in 1749 ms of which 1 ms to minimize.
[2023-03-22 04:58:07] [INFO ] Deduced a trap composed of 400 places in 1874 ms of which 2 ms to minimize.
[2023-03-22 04:58:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6661 ms
[2023-03-22 04:58:11] [INFO ] Deduced a trap composed of 581 places in 2299 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-22 04:58:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:58:11] [INFO ] After 25140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 316 ms.
Support contains 99 out of 1837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1633 edges and 1837 vertex of which 88 / 1837 are part of one of the 12 SCC in 23 ms
Free SCC test removed 76 places
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 2763 edges and 1761 vertex of which 1755 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.38 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1198 place count 1755 transition count 2165
Reduce places removed 1193 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 1213 rules applied. Total rules applied 2411 place count 562 transition count 2145
Reduce places removed 8 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 2 with 87 rules applied. Total rules applied 2498 place count 554 transition count 2066
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 82 rules applied. Total rules applied 2580 place count 475 transition count 2063
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 2580 place count 475 transition count 1996
Deduced a syphon composed of 67 places in 4 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 2714 place count 408 transition count 1996
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 2766 place count 356 transition count 1944
Iterating global reduction 4 with 52 rules applied. Total rules applied 2818 place count 356 transition count 1944
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2818 place count 356 transition count 1943
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2820 place count 355 transition count 1943
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 2840 place count 335 transition count 703
Iterating global reduction 4 with 20 rules applied. Total rules applied 2860 place count 335 transition count 703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2864 place count 335 transition count 699
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2867 place count 332 transition count 696
Iterating global reduction 5 with 3 rules applied. Total rules applied 2870 place count 332 transition count 696
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2872 place count 330 transition count 694
Iterating global reduction 5 with 2 rules applied. Total rules applied 2874 place count 330 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2875 place count 330 transition count 693
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 2927 place count 304 transition count 667
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2933 place count 298 transition count 661
Iterating global reduction 6 with 6 rules applied. Total rules applied 2939 place count 298 transition count 661
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2943 place count 294 transition count 657
Iterating global reduction 6 with 4 rules applied. Total rules applied 2947 place count 294 transition count 657
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2950 place count 291 transition count 654
Iterating global reduction 6 with 3 rules applied. Total rules applied 2953 place count 291 transition count 654
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2959 place count 288 transition count 673
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2966 place count 288 transition count 666
Free-agglomeration rule applied 55 times.
Iterating global reduction 6 with 55 rules applied. Total rules applied 3021 place count 288 transition count 611
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 6 with 55 rules applied. Total rules applied 3076 place count 233 transition count 611
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 7 with 39 rules applied. Total rules applied 3115 place count 233 transition count 572
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 3123 place count 233 transition count 572
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 3127 place count 233 transition count 568
Applied a total of 3127 rules in 888 ms. Remains 233 /1837 variables (removed 1604) and now considering 568/3460 (removed 2892) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 890 ms. Remains : 233/1837 places, 568/3460 transitions.
Incomplete random walk after 10000 steps, including 499 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 568 rows 233 cols
[2023-03-22 04:58:13] [INFO ] Computed 7 place invariants in 15 ms
[2023-03-22 04:58:13] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 04:58:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 04:58:14] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 04:58:14] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-22 04:58:14] [INFO ] After 377ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 04:58:15] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 1 ms to minimize.
[2023-03-22 04:58:15] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 1 ms to minimize.
[2023-03-22 04:58:15] [INFO ] Deduced a trap composed of 55 places in 307 ms of which 1 ms to minimize.
[2023-03-22 04:58:16] [INFO ] Deduced a trap composed of 63 places in 288 ms of which 1 ms to minimize.
[2023-03-22 04:58:16] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 1 ms to minimize.
[2023-03-22 04:58:16] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 1 ms to minimize.
[2023-03-22 04:58:17] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 1 ms to minimize.
[2023-03-22 04:58:17] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 0 ms to minimize.
[2023-03-22 04:58:17] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2023-03-22 04:58:17] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 0 ms to minimize.
[2023-03-22 04:58:18] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 1 ms to minimize.
[2023-03-22 04:58:18] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 1 ms to minimize.
[2023-03-22 04:58:18] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 0 ms to minimize.
[2023-03-22 04:58:18] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 1 ms to minimize.
[2023-03-22 04:58:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4141 ms
[2023-03-22 04:58:19] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 1 ms to minimize.
[2023-03-22 04:58:19] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2023-03-22 04:58:19] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 1 ms to minimize.
[2023-03-22 04:58:19] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 1 ms to minimize.
[2023-03-22 04:58:20] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 1 ms to minimize.
[2023-03-22 04:58:20] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 1 ms to minimize.
[2023-03-22 04:58:20] [INFO ] Deduced a trap composed of 50 places in 277 ms of which 1 ms to minimize.
[2023-03-22 04:58:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1689 ms
[2023-03-22 04:58:20] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 1 ms to minimize.
[2023-03-22 04:58:21] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 0 ms to minimize.
[2023-03-22 04:58:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 436 ms
[2023-03-22 04:58:21] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 0 ms to minimize.
[2023-03-22 04:58:21] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 0 ms to minimize.
[2023-03-22 04:58:22] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 2 ms to minimize.
[2023-03-22 04:58:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 741 ms
[2023-03-22 04:58:22] [INFO ] After 7855ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-03-22 04:58:22] [INFO ] After 8764ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 58 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 568/568 transitions.
Graph (trivial) has 83 edges and 233 vertex of which 7 / 233 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 643 edges and 229 vertex of which 227 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 227 transition count 526
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 72 place count 196 transition count 519
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 190 transition count 519
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 78 place count 190 transition count 515
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 86 place count 186 transition count 515
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 183 transition count 512
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 183 transition count 512
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 108 place count 175 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 175 transition count 502
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 171 transition count 498
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 171 transition count 498
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 169 transition count 496
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 169 transition count 496
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 155 place count 169 transition count 463
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 168 transition count 471
Free-agglomeration rule applied 7 times with reduction of 16 identical transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 164 place count 168 transition count 448
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 187 place count 161 transition count 432
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 5 with 49 rules applied. Total rules applied 236 place count 161 transition count 383
Applied a total of 236 rules in 237 ms. Remains 161 /233 variables (removed 72) and now considering 383/568 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 161/233 places, 383/568 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 446080 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{0=1}
Probabilistic random walk after 446080 steps, saw 80255 distinct states, run finished after 3005 ms. (steps per millisecond=148 ) properties seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 383 rows 161 cols
[2023-03-22 04:58:26] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-22 04:58:26] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:58:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 04:58:27] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 04:58:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-22 04:58:27] [INFO ] After 272ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 04:58:27] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2023-03-22 04:58:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-22 04:58:28] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 1 ms to minimize.
[2023-03-22 04:58:28] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2023-03-22 04:58:28] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 0 ms to minimize.
[2023-03-22 04:58:28] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2023-03-22 04:58:28] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 1 ms to minimize.
[2023-03-22 04:58:28] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 4 ms to minimize.
[2023-03-22 04:58:29] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2023-03-22 04:58:29] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2023-03-22 04:58:29] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-22 04:58:29] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2023-03-22 04:58:29] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-22 04:58:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1679 ms
[2023-03-22 04:58:29] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2023-03-22 04:58:30] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2023-03-22 04:58:30] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 1 ms to minimize.
[2023-03-22 04:58:30] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2023-03-22 04:58:30] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2023-03-22 04:58:30] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2023-03-22 04:58:30] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2023-03-22 04:58:31] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2023-03-22 04:58:31] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 5 ms to minimize.
[2023-03-22 04:58:31] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2023-03-22 04:58:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1599 ms
[2023-03-22 04:58:31] [INFO ] After 4029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-03-22 04:58:31] [INFO ] After 4748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 45 ms.
Support contains 56 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 383/383 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 161 transition count 381
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 159 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 158 transition count 380
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 157 transition count 379
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 157 transition count 378
Applied a total of 9 rules in 66 ms. Remains 157 /161 variables (removed 4) and now considering 378/383 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 157/161 places, 378/383 transitions.
Incomplete random walk after 10000 steps, including 582 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 500339 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 500339 steps, saw 89129 distinct states, run finished after 3002 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 378 rows 157 cols
[2023-03-22 04:58:35] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-22 04:58:35] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:58:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-22 04:58:35] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 04:58:35] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-22 04:58:36] [INFO ] After 174ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 04:58:36] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2023-03-22 04:58:36] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 1 ms to minimize.
[2023-03-22 04:58:36] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2023-03-22 04:58:36] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 1 ms to minimize.
[2023-03-22 04:58:37] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2023-03-22 04:58:37] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2023-03-22 04:58:37] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 1 ms to minimize.
[2023-03-22 04:58:37] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2023-03-22 04:58:38] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 1 ms to minimize.
[2023-03-22 04:58:38] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2023-03-22 04:58:38] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2023-03-22 04:58:38] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2023-03-22 04:58:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2526 ms
[2023-03-22 04:58:38] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2023-03-22 04:58:38] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2023-03-22 04:58:39] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2023-03-22 04:58:39] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-03-22 04:58:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 659 ms
[2023-03-22 04:58:39] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2023-03-22 04:58:39] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2023-03-22 04:58:39] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2023-03-22 04:58:39] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-22 04:58:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 588 ms
[2023-03-22 04:58:40] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2023-03-22 04:58:40] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2023-03-22 04:58:40] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2023-03-22 04:58:40] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2023-03-22 04:58:40] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-03-22 04:58:40] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-22 04:58:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 914 ms
[2023-03-22 04:58:40] [INFO ] After 5093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-22 04:58:41] [INFO ] After 5687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 60 ms.
Support contains 56 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 378/378 transitions.
Applied a total of 0 rules in 23 ms. Remains 157 /157 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 157/157 places, 378/378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 378/378 transitions.
Applied a total of 0 rules in 21 ms. Remains 157 /157 variables (removed 0) and now considering 378/378 (removed 0) transitions.
[2023-03-22 04:58:41] [INFO ] Invariant cache hit.
[2023-03-22 04:58:41] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-22 04:58:41] [INFO ] Invariant cache hit.
[2023-03-22 04:58:41] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-22 04:58:42] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-22 04:58:42] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-22 04:58:42] [INFO ] Invariant cache hit.
[2023-03-22 04:58:42] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1043 ms. Remains : 157/157 places, 378/378 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 0 with 18 rules applied. Total rules applied 18 place count 157 transition count 360
Reduce places removed 18 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 26 rules applied. Total rules applied 44 place count 139 transition count 352
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 131 transition count 351
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 53 place count 131 transition count 348
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 128 transition count 348
Performed 10 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 79 place count 118 transition count 335
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 97 place count 118 transition count 317
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 105 place count 118 transition count 309
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 110 place count 118 transition count 304
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 115 place count 113 transition count 304
Applied a total of 115 rules in 40 ms. Remains 113 /157 variables (removed 44) and now considering 304/378 (removed 74) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 304 rows 113 cols
[2023-03-22 04:58:42] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-22 04:58:42] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:58:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-22 04:58:42] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 04:58:43] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-22 04:58:43] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2023-03-22 04:58:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-22 04:58:43] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-22 04:58:43] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2023-03-22 04:58:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-03-22 04:58:43] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-22 04:58:43] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2023-03-22 04:58:43] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2023-03-22 04:58:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
[2023-03-22 04:58:43] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-22 04:58:43] [INFO ] After 1489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-22 04:58:43] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-22 04:58:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 378 transitions and 2804 arcs took 7 ms.
[2023-03-22 04:58:44] [INFO ] Flatten gal took : 119 ms
Total runtime 63012 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: StigmergyCommit_PT_05b
(NrP: 157 NrTr: 378 NrArc: 2804)

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

net check time: 0m 0.000sec

init dd package: 0m 3.394sec


RS generation: 0m 3.536sec


-> reachability set: #nodes 23170 (2.3e+04) #states 35,069,551 (7)



starting MCC model checker
--------------------------

checking: EF [[p62<=1 & 1<=p62]]
normalized: E [true U [p62<=1 & 1<=p62]]

abstracting: (1<=p62)
states: 1,364,454 (6)
abstracting: (p62<=1)
states: 35,069,551 (7)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.126sec

checking: AG [[p59<=0 & 0<=p59]]
normalized: ~ [E [true U ~ [[p59<=0 & 0<=p59]]]]

abstracting: (0<=p59)
states: 35,069,551 (7)
abstracting: (p59<=0)
states: 33,705,097 (7)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.590sec

checking: AG [[[p94<=0 & 0<=p94] | [p145<=1 & 1<=p145]]]
normalized: ~ [E [true U ~ [[[p145<=1 & 1<=p145] | [p94<=0 & 0<=p94]]]]]

abstracting: (0<=p94)
states: 35,069,551 (7)
abstracting: (p94<=0)
states: 33,705,097 (7)
abstracting: (1<=p145)
states: 1,685,502 (6)
abstracting: (p145<=1)
states: 35,069,551 (7)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.094sec

checking: AG [[[0<=p12 & p12<=0] & [[p133<=0 & 0<=p133] | [[p108<=0 & 0<=p108] & [[p125<=0 & 0<=p125] | [p137<=1 & 1<=p137]]]]]]
normalized: ~ [E [true U ~ [[[[[[p137<=1 & 1<=p137] | [p125<=0 & 0<=p125]] & [p108<=0 & 0<=p108]] | [p133<=0 & 0<=p133]] & [0<=p12 & p12<=0]]]]]

abstracting: (p12<=0)
states: 33,022,870 (7)
abstracting: (0<=p12)
states: 35,069,551 (7)
abstracting: (0<=p133)
states: 35,069,551 (7)
abstracting: (p133<=0)
states: 35,059,351 (7)
abstracting: (0<=p108)
states: 35,069,551 (7)
abstracting: (p108<=0)
states: 34,770,031 (7)
abstracting: (0<=p125)
states: 35,069,551 (7)
abstracting: (p125<=0)
states: 34,283,311 (7)
abstracting: (1<=p137)
states: 11,088 (4)
abstracting: (p137<=1)
states: 35,069,551 (7)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.911sec

checking: AG [[[[[p122<=0 & 0<=p122] | [1<=p80 & p80<=1]] | [p31<=1 & 1<=p31]] | [[[p144<=1 & 1<=p144] | [[p101<=1 & 1<=p101] & [p153<=1 & 1<=p153]]] | [[1<=p46 & p46<=1] | [1<=p118 & p118<=1]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p118 & p118<=1] | [1<=p46 & p46<=1]] | [[[p153<=1 & 1<=p153] & [p101<=1 & 1<=p101]] | [p144<=1 & 1<=p144]]] | [[p31<=1 & 1<=p31] | [[1<=p80 & p80<=1] | [p122<=0 & 0<=p122]]]]]]]

abstracting: (0<=p122)
states: 35,069,551 (7)
abstracting: (p122<=0)
states: 32,865,433 (7)
abstracting: (p80<=1)
states: 35,069,551 (7)
abstracting: (1<=p80)
states: 1,672,890 (6)
abstracting: (1<=p31)
states: 4,093,362 (6)
abstracting: (p31<=1)
states: 35,069,551 (7)
abstracting: (1<=p144)
states: 1,685,502 (6)
abstracting: (p144<=1)
states: 35,069,551 (7)
abstracting: (1<=p101)
states: 299,520 (5)
abstracting: (p101<=1)
states: 35,069,551 (7)
abstracting: (1<=p153)
states: 524,160 (5)
abstracting: (p153<=1)
states: 35,069,551 (7)
abstracting: (p46<=1)
states: 35,069,551 (7)
abstracting: (1<=p46)
states: 2,006,124 (6)
abstracting: (p118<=1)
states: 35,069,551 (7)
abstracting: (1<=p118)
states: 2,204,118 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.522sec

checking: EF [[[[p55<=1 & 1<=p55] & [[[[[1<=p88 & p88<=1] | [p132<=1 & 1<=p132]] & [[p65<=1 & 1<=p65] | [p26<=0 & 0<=p26]]] | [p72<=1 & 1<=p72]] | [[p89<=1 & 1<=p89] | [p68<=0 & 0<=p68]]]] & [0<=p42 & p42<=0]]]
normalized: E [true U [[0<=p42 & p42<=0] & [[[[p68<=0 & 0<=p68] | [p89<=1 & 1<=p89]] | [[p72<=1 & 1<=p72] | [[[p26<=0 & 0<=p26] | [p65<=1 & 1<=p65]] & [[p132<=1 & 1<=p132] | [1<=p88 & p88<=1]]]]] & [p55<=1 & 1<=p55]]]]

abstracting: (1<=p55)
states: 1,364,454 (6)
abstracting: (p55<=1)
states: 35,069,551 (7)
abstracting: (p88<=1)
states: 35,069,551 (7)
abstracting: (1<=p88)
states: 1,672,890 (6)
abstracting: (1<=p132)
states: 2,219,310 (6)
abstracting: (p132<=1)
states: 35,069,551 (7)
abstracting: (1<=p65)
states: 2,006,124 (6)
abstracting: (p65<=1)
states: 35,069,551 (7)
abstracting: (0<=p26)
states: 35,069,551 (7)
abstracting: (p26<=0)
states: 34,585,711 (7)
abstracting: (1<=p72)
states: 5,400 (3)
abstracting: (p72<=1)
states: 35,069,551 (7)
abstracting: (1<=p89)
states: 1,364,454 (6)
abstracting: (p89<=1)
states: 35,069,551 (7)
abstracting: (0<=p68)
states: 35,069,551 (7)
abstracting: (p68<=0)
states: 34,440,559 (7)
abstracting: (p42<=0)
states: 35,050,543 (7)
abstracting: (0<=p42)
states: 35,069,551 (7)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.391sec

checking: EF [[[[1<=p8 & p8<=1] & [0<=p133 & p133<=0]] | [[[[[[[[[p6<=0 & 0<=p6] | [[1<=p134 & p134<=1] & [p143<=0 & 0<=p143]]] & [[p86<=0 & 0<=p86] | [p13<=1 & 1<=p13]]] | [[p117<=0 & 0<=p117] & [[p84<=0 & 0<=p84] | [p21<=1 & 1<=p21]]]] | [[p63<=0 & 0<=p63] & [p98<=1 & 1<=p98]]] & [[p48<=1 & 1<=p48] | [p156<=0 & 0<=p156]]] & [p53<=0 & 0<=p53]] | [[[0<=p50 & p50<=0] & [[p83<=1 & 1<=p83] & [p140<=0 & 0<=p140]]] & [[[p76<=0 & 0<=p76] & [p40<=1 & 1<=p40]] & [[[p38<=0 & 0<=p38] | [p74<=1 & 1<=p74]] & [[p3<=1 & 1<=p3] | [[p5<=0 & 0<=p5] | [p91<=1 & 1<=p91]]]]]]] & [[[[p104<=1 & 1<=p104] & [1<=p114 & p114<=1]] & [p29<=0 & 0<=p29]] | [[p130<=1 & 1<=p130] & [[1<=p142 & p142<=1] & [p112<=0 & 0<=p112]]]]]]]
normalized: E [true U [[[[[[p112<=0 & 0<=p112] & [1<=p142 & p142<=1]] & [p130<=1 & 1<=p130]] | [[p29<=0 & 0<=p29] & [[1<=p114 & p114<=1] & [p104<=1 & 1<=p104]]]] & [[[[[[[p91<=1 & 1<=p91] | [p5<=0 & 0<=p5]] | [p3<=1 & 1<=p3]] & [[p74<=1 & 1<=p74] | [p38<=0 & 0<=p38]]] & [[p40<=1 & 1<=p40] & [p76<=0 & 0<=p76]]] & [[[p140<=0 & 0<=p140] & [p83<=1 & 1<=p83]] & [0<=p50 & p50<=0]]] | [[p53<=0 & 0<=p53] & [[[p156<=0 & 0<=p156] | [p48<=1 & 1<=p48]] & [[[p98<=1 & 1<=p98] & [p63<=0 & 0<=p63]] | [[[[p21<=1 & 1<=p21] | [p84<=0 & 0<=p84]] & [p117<=0 & 0<=p117]] | [[[p13<=1 & 1<=p13] | [p86<=0 & 0<=p86]] & [[[p143<=0 & 0<=p143] & [1<=p134 & p134<=1]] | [p6<=0 & 0<=p6]]]]]]]]] | [[0<=p133 & p133<=0] & [1<=p8 & p8<=1]]]]

abstracting: (p8<=1)
states: 35,069,551 (7)
abstracting: (1<=p8)
states: 2,046,681 (6)
abstracting: (p133<=0)
states: 35,059,351 (7)
abstracting: (0<=p133)
states: 35,069,551 (7)
abstracting: (0<=p6)
states: 35,069,551 (7)
abstracting: (p6<=0)
states: 33,022,870 (7)
abstracting: (p134<=1)
states: 35,069,551 (7)
abstracting: (1<=p134)
states: 11,088 (4)
abstracting: (0<=p143)
states: 35,069,551 (7)
abstracting: (p143<=0)
states: 33,384,049 (7)
abstracting: (0<=p86)
states: 35,069,551 (7)
abstracting: (p86<=0)
states: 33,396,661 (7)
abstracting: (1<=p13)
states: 2,046,681 (6)
abstracting: (p13<=1)
states: 35,069,551 (7)
abstracting: (0<=p117)
states: 35,069,551 (7)
abstracting: (p117<=0)
states: 32,865,433 (7)
abstracting: (0<=p84)
states: 35,069,551 (7)
abstracting: (p84<=0)
states: 33,396,661 (7)
abstracting: (1<=p21)
states: 483,840 (5)
abstracting: (p21<=1)
states: 35,069,551 (7)
abstracting: (0<=p63)
states: 35,069,551 (7)
abstracting: (p63<=0)
states: 33,705,097 (7)
abstracting: (1<=p98)
states: 1,364,454 (6)
abstracting: (p98<=1)
states: 35,069,551 (7)
abstracting: (1<=p48)
states: 1,364,454 (6)
abstracting: (p48<=1)
states: 35,069,551 (7)
abstracting: (0<=p156)
states: 35,069,551 (7)
abstracting: (p156<=0)
states: 23,379,701 (7)
abstracting: (0<=p53)
states: 35,069,551 (7)
abstracting: (p53<=0)
states: 33,705,097 (7)
abstracting: (p50<=0)
states: 33,705,097 (7)
abstracting: (0<=p50)
states: 35,069,551 (7)
abstracting: (1<=p83)
states: 1,672,890 (6)
abstracting: (p83<=1)
states: 35,069,551 (7)
abstracting: (0<=p140)
states: 35,069,551 (7)
abstracting: (p140<=0)
states: 32,850,241 (7)
abstracting: (0<=p76)
states: 35,069,551 (7)
abstracting: (p76<=0)
states: 35,064,151 (7)
abstracting: (1<=p40)
states: 786,240 (5)
abstracting: (p40<=1)
states: 35,069,551 (7)
abstracting: (0<=p38)
states: 35,069,551 (7)
abstracting: (p38<=0)
states: 34,283,311 (7)
abstracting: (1<=p74)
states: 5,400 (3)
abstracting: (p74<=1)
states: 35,069,551 (7)
abstracting: (1<=p3)
states: 18,360 (4)
abstracting: (p3<=1)
states: 35,069,551 (7)
abstracting: (0<=p5)
states: 35,069,551 (7)
abstracting: (p5<=0)
states: 32,519,206 (7)
abstracting: (1<=p91)
states: 1,364,454 (6)
abstracting: (p91<=1)
states: 35,069,551 (7)
abstracting: (1<=p104)
states: 299,520 (5)
abstracting: (p104<=1)
states: 35,069,551 (7)
abstracting: (p114<=1)
states: 35,069,551 (7)
abstracting: (1<=p114)
states: 2,204,118 (6)
abstracting: (0<=p29)
states: 35,069,551 (7)
abstracting: (p29<=0)
states: 35,025,199 (7)
abstracting: (1<=p130)
states: 2,219,310 (6)
abstracting: (p130<=1)
states: 35,069,551 (7)
abstracting: (p142<=1)
states: 35,069,551 (7)
abstracting: (1<=p142)
states: 1,685,502 (6)
abstracting: (0<=p112)
states: 35,069,551 (7)
abstracting: (p112<=0)
states: 32,044,411 (7)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.933sec

totally nodes used: 6866335 (6.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27982065 66827089 94809154
used/not used/entry size/cache size: 44132106 22976758 16 1024MB
basic ops cache: hits/miss/sum: 4634291 7589984 12224275
used/not used/entry size/cache size: 9383138 7394078 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 57224 158758 215982
used/not used/entry size/cache size: 157440 8231168 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61123969
1 5236191
2 633894
3 98919
4 14043
5 1680
6 153
7 11
8 4
9 0
>= 10 0

Total processing time: 0m43.311sec


BK_STOP 1679461168880

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec


iterations count:54577 (144), effective:1240 (3)

initing FirstDep: 0m 0.001sec

26017
iterations count:144832 (383), effective:2466 (6)
25253
iterations count:146339 (387), effective:2478 (6)
25406
iterations count:145725 (385), effective:2502 (6)
25040
iterations count:146698 (388), effective:2523 (6)
24336
iterations count:143772 (380), effective:2460 (6)
27170
iterations count:143630 (379), effective:2418 (6)
25992
iterations count:143648 (380), effective:2461 (6)

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-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is StigmergyCommit-PT-05b, 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 r458-smll-167912650300454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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