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.r457-smll-167912649300454.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 ltsminxred
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 r457-smll-167912649300454
=====================================================================

--------------------
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 1679444736854

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:25:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 00:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:25:40] [INFO ] Load time of PNML (sax parser for PT used): 427 ms
[2023-03-22 00:25:40] [INFO ] Transformed 1837 places.
[2023-03-22 00:25:40] [INFO ] Transformed 3460 transitions.
[2023-03-22 00:25:40] [INFO ] Found NUPN structural information;
[2023-03-22 00:25:40] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 637 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 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 87 resets, run finished after 732 ms. (steps per millisecond=13 ) 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 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 3460 rows 1837 cols
[2023-03-22 00:25:42] [INFO ] Computed 7 place invariants in 104 ms
[2023-03-22 00:25:43] [INFO ] After 1322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 00:25:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 23 ms returned sat
[2023-03-22 00:25:49] [INFO ] After 4650ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-22 00:25:51] [INFO ] Deduced a trap composed of 488 places in 1591 ms of which 13 ms to minimize.
[2023-03-22 00:25:53] [INFO ] Deduced a trap composed of 396 places in 1446 ms of which 5 ms to minimize.
[2023-03-22 00:25:54] [INFO ] Deduced a trap composed of 397 places in 1295 ms of which 2 ms to minimize.
[2023-03-22 00:25:55] [INFO ] Deduced a trap composed of 396 places in 1201 ms of which 2 ms to minimize.
[2023-03-22 00:25:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6279 ms
[2023-03-22 00:25:58] [INFO ] Deduced a trap composed of 399 places in 1634 ms of which 1 ms to minimize.
[2023-03-22 00:26:00] [INFO ] Deduced a trap composed of 396 places in 1484 ms of which 1 ms to minimize.
[2023-03-22 00:26:01] [INFO ] Deduced a trap composed of 400 places in 1480 ms of which 2 ms to minimize.
[2023-03-22 00:26:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5460 ms
[2023-03-22 00:26:04] [INFO ] Deduced a trap composed of 581 places in 2022 ms of which 3 ms to minimize.
[2023-03-22 00:26:06] [INFO ] Deduced a trap composed of 492 places in 1560 ms of which 2 ms to minimize.
[2023-03-22 00:26:09] [INFO ] Deduced a trap composed of 397 places in 2034 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 00:26:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:26:09] [INFO ] After 25284ms 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 242 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 12 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.31 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 3 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 2 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 0 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 842 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 843 ms. Remains : 233/1837 places, 568/3460 transitions.
Incomplete random walk after 10000 steps, including 504 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 10) seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 568 rows 233 cols
[2023-03-22 00:26:10] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-22 00:26:11] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 00:26:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 00:26:11] [INFO ] After 458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 00:26:11] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-22 00:26:12] [INFO ] After 351ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 00:26:12] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:26:12] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 1 ms to minimize.
[2023-03-22 00:26:12] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 1 ms to minimize.
[2023-03-22 00:26:13] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:26:13] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:26:13] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 1 ms to minimize.
[2023-03-22 00:26:13] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 1 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 1 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 0 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:26:14] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2943 ms
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 1 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 0 ms to minimize.
[2023-03-22 00:26:15] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 1 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 1 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 0 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2023-03-22 00:26:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1382 ms
[2023-03-22 00:26:16] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 0 ms to minimize.
[2023-03-22 00:26:17] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:26:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 305 ms
[2023-03-22 00:26:17] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2023-03-22 00:26:17] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 4 ms to minimize.
[2023-03-22 00:26:17] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 1 ms to minimize.
[2023-03-22 00:26:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2023-03-22 00:26:17] [INFO ] After 5930ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 277 ms.
[2023-03-22 00:26:18] [INFO ] After 6842ms 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 51 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.2 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 1 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 1 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 0 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 166 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 168 ms. Remains : 161/233 places, 383/568 transitions.
Incomplete random walk after 10000 steps, including 587 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 508690 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{0=1}
Probabilistic random walk after 508690 steps, saw 89965 distinct states, run finished after 3002 ms. (steps per millisecond=169 ) 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 00:26:21] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-22 00:26:21] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 00:26:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 00:26:22] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 00:26:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-22 00:26:22] [INFO ] After 186ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 00:26:22] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-22 00:26:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-22 00:26:22] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:26:22] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2023-03-22 00:26:22] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 0 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2023-03-22 00:26:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1292 ms
[2023-03-22 00:26:24] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2023-03-22 00:26:24] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2023-03-22 00:26:24] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:26:24] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2023-03-22 00:26:24] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:26:24] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:26:24] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 14 ms to minimize.
[2023-03-22 00:26:25] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2023-03-22 00:26:25] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:26:25] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:26:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1324 ms
[2023-03-22 00:26:25] [INFO ] After 3122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-22 00:26:25] [INFO ] After 3666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 20 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 43 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 43 ms. Remains : 157/161 places, 378/383 transitions.
Incomplete random walk after 10000 steps, including 586 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 486760 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486760 steps, saw 86715 distinct states, run finished after 3002 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 378 rows 157 cols
[2023-03-22 00:26:29] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-22 00:26:29] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 00:26:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-22 00:26:29] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 00:26:29] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-22 00:26:29] [INFO ] After 184ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 00:26:29] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2023-03-22 00:26:30] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2023-03-22 00:26:30] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:26:30] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2023-03-22 00:26:30] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2023-03-22 00:26:30] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
[2023-03-22 00:26:30] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 1 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 12 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1784 ms
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:26:31] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 472 ms
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 417 ms
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:26:32] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2023-03-22 00:26:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 727 ms
[2023-03-22 00:26:33] [INFO ] After 3758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-22 00:26:33] [INFO ] After 4293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 58 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 16 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 16 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 15 ms. Remains 157 /157 variables (removed 0) and now considering 378/378 (removed 0) transitions.
[2023-03-22 00:26:33] [INFO ] Invariant cache hit.
[2023-03-22 00:26:33] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-22 00:26:33] [INFO ] Invariant cache hit.
[2023-03-22 00:26:34] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-22 00:26:34] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-22 00:26:34] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 00:26:34] [INFO ] Invariant cache hit.
[2023-03-22 00:26:34] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1207 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 51 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 00:26:34] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-22 00:26:34] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 00:26:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-22 00:26:35] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 00:26:35] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-22 00:26:35] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2023-03-22 00:26:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-22 00:26:35] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-22 00:26:35] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-22 00:26:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-22 00:26:35] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2023-03-22 00:26:35] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2023-03-22 00:26:36] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:26:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-03-22 00:26:36] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-22 00:26:36] [INFO ] After 1237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-22 00:26:36] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-22 00:26:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 378 transitions and 2804 arcs took 5 ms.
[2023-03-22 00:26:36] [INFO ] Flatten gal took : 155 ms
Total runtime 57097 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/788/inv_0_ --invariant=/tmp/788/inv_1_ --invariant=/tmp/788/inv_2_ --invariant=/tmp/788/inv_3_ --invariant=/tmp/788/inv_4_ --invariant=/tmp/788/inv_5_ --invariant=/tmp/788/inv_6_ --inv-par
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679444802082

--------------------
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
mcc2023
rfs formula name StigmergyCommit-PT-05b-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/788/inv_0_
rfs formula name StigmergyCommit-PT-05b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/788/inv_1_
rfs formula name StigmergyCommit-PT-05b-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/788/inv_2_
rfs formula name StigmergyCommit-PT-05b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/788/inv_3_
rfs formula name StigmergyCommit-PT-05b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/788/inv_4_
rfs formula name StigmergyCommit-PT-05b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/788/inv_5_
rfs formula name StigmergyCommit-PT-05b-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/788/inv_6_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 157 places, 378 transitions and 2804 arcs
pnml2lts-sym: Petri net StigmergyCommit_PT_05b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 378->244 groups
pnml2lts-sym: Regrouping took 0.140 real 0.130 user 0.000 sys
pnml2lts-sym: state vector length is 157; there are 244 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/788/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/788/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/788/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/788/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/788/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/788/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/788/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 3.510 real 13.990 user 0.000 sys
pnml2lts-sym: max token count: 1

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r457-smll-167912649300454"
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 ;