Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.2K Feb 26 11:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 11:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 11:04 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 12M 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-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679364149117

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 02:02:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 02:02:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 02:02:32] [INFO ] Load time of PNML (sax parser for PT used): 932 ms
[2023-03-21 02:02:32] [INFO ] Transformed 2443 places.
[2023-03-21 02:02:33] [INFO ] Transformed 15956 transitions.
[2023-03-21 02:02:33] [INFO ] Found NUPN structural information;
[2023-03-21 02:02:33] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 1266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 869 ms. (steps per millisecond=11 ) properties (out of 12) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 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 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
[2023-03-21 02:02:37] [INFO ] Flatten gal took : 2562 ms
Interrupted probabilistic random walk after 41102 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{5=1}
Probabilistic random walk after 41102 steps, saw 13644 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 15956 rows 2443 cols
[2023-03-21 02:02:39] [INFO ] Flatten gal took : 1394 ms
[2023-03-21 02:02:39] [INFO ] Computed 9 place invariants in 577 ms
[2023-03-21 02:02:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10322930140087301662.gal : 479 ms
[2023-03-21 02:02:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3151069487364323239.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10322930140087301662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3151069487364323239.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2023-03-21 02:02:41] [INFO ] After 1672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 02:02:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 29 ms returned sat
Loading property file /tmp/ReachabilityCardinality3151069487364323239.prop.
[2023-03-21 02:02:59] [INFO ] After 16651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 02:03:11] [INFO ] Deduced a trap composed of 396 places in 11279 ms of which 27 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 02:03:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 02:03:11] [INFO ] After 29957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 527 ms.
Support contains 63 out of 2443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2305 edges and 2443 vertex of which 148 / 2443 are part of one of the 22 SCC in 19 ms
Free SCC test removed 126 places
Drop transitions removed 161 transitions
Reduce isomorphic transitions removed 161 transitions.
Graph (complete) has 3996 edges and 2317 vertex of which 2301 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.98 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1709 transitions
Trivial Post-agglo rules discarded 1709 transitions
Performed 1709 trivial Post agglomeration. Transition count delta: 1709
Iterating post reduction 0 with 1717 rules applied. Total rules applied 1719 place count 2301 transition count 14070
Reduce places removed 1709 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 1757 rules applied. Total rules applied 3476 place count 592 transition count 14022
Reduce places removed 20 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 2 with 70 rules applied. Total rules applied 3546 place count 572 transition count 13972
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 3598 place count 522 transition count 13970
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 3598 place count 522 transition count 13879
Deduced a syphon composed of 91 places in 32 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 3780 place count 431 transition count 13879
Discarding 80 places :
Symmetric choice reduction at 4 with 80 rule applications. Total rules 3860 place count 351 transition count 13799
Iterating global reduction 4 with 80 rules applied. Total rules applied 3940 place count 351 transition count 13799
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3940 place count 351 transition count 13798
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3942 place count 350 transition count 13798
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 3977 place count 315 transition count 1408
Iterating global reduction 4 with 35 rules applied. Total rules applied 4012 place count 315 transition count 1408
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 4026 place count 315 transition count 1394
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4032 place count 309 transition count 1388
Iterating global reduction 5 with 6 rules applied. Total rules applied 4038 place count 309 transition count 1388
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 4043 place count 304 transition count 1383
Iterating global reduction 5 with 5 rules applied. Total rules applied 4048 place count 304 transition count 1383
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4053 place count 304 transition count 1378
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 4111 place count 275 transition count 1349
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4112 place count 275 transition count 1348
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4120 place count 267 transition count 1340
Iterating global reduction 7 with 8 rules applied. Total rules applied 4128 place count 267 transition count 1340
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 4133 place count 262 transition count 1335
Iterating global reduction 7 with 5 rules applied. Total rules applied 4138 place count 262 transition count 1335
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4141 place count 259 transition count 1332
Iterating global reduction 7 with 3 rules applied. Total rules applied 4144 place count 259 transition count 1332
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4154 place count 254 transition count 1347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 4156 place count 254 transition count 1345
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4158 place count 254 transition count 1343
Free-agglomeration rule applied 67 times.
Iterating global reduction 8 with 67 rules applied. Total rules applied 4225 place count 254 transition count 1276
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 8 with 67 rules applied. Total rules applied 4292 place count 187 transition count 1276
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 4299 place count 180 transition count 1269
Iterating global reduction 9 with 7 rules applied. Total rules applied 4306 place count 180 transition count 1269
Drop transitions removed 260 transitions
Redundant transition composition rules discarded 260 transitions
Iterating global reduction 9 with 260 rules applied. Total rules applied 4566 place count 180 transition count 1009
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4567 place count 180 transition count 1008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4568 place count 179 transition count 1008
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 4575 place count 179 transition count 1008
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 4581 place count 179 transition count 1002
Applied a total of 4581 rules in 5171 ms. Remains 179 /2443 variables (removed 2264) and now considering 1002/15956 (removed 14954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5178 ms. Remains : 179/2443 places, 1002/15956 transitions.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 10) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 37 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 37 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1002 rows 179 cols
[2023-03-21 02:03:17] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-21 02:03:17] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 02:03:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-21 02:03:18] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 02:03:18] [INFO ] State equation strengthened by 835 read => feed constraints.
[2023-03-21 02:03:19] [INFO ] After 1003ms SMT Verify possible using 835 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 02:03:20] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 2 ms to minimize.
[2023-03-21 02:03:20] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 2 ms to minimize.
[2023-03-21 02:03:20] [INFO ] Deduced a trap composed of 22 places in 339 ms of which 2 ms to minimize.
[2023-03-21 02:03:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1389 ms
[2023-03-21 02:03:21] [INFO ] Deduced a trap composed of 16 places in 340 ms of which 1 ms to minimize.
[2023-03-21 02:03:21] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 1 ms to minimize.
[2023-03-21 02:03:22] [INFO ] Deduced a trap composed of 16 places in 272 ms of which 1 ms to minimize.
[2023-03-21 02:03:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1133 ms
[2023-03-21 02:03:22] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 1 ms to minimize.
[2023-03-21 02:03:23] [INFO ] Deduced a trap composed of 37 places in 341 ms of which 2 ms to minimize.
[2023-03-21 02:03:23] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 1 ms to minimize.
[2023-03-21 02:03:23] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 0 ms to minimize.
[2023-03-21 02:03:23] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 1 ms to minimize.
[2023-03-21 02:03:24] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2023-03-21 02:03:24] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 0 ms to minimize.
[2023-03-21 02:03:24] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2023-03-21 02:03:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2682 ms
[2023-03-21 02:03:25] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 0 ms to minimize.
[2023-03-21 02:03:25] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 3 ms to minimize.
[2023-03-21 02:03:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 571 ms
[2023-03-21 02:03:26] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2023-03-21 02:03:26] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 0 ms to minimize.
[2023-03-21 02:03:26] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 1 ms to minimize.
[2023-03-21 02:03:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1100 ms
[2023-03-21 02:03:27] [INFO ] After 8547ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 471 ms.
[2023-03-21 02:03:27] [INFO ] After 9782ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 32 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1002/1002 transitions.
Graph (trivial) has 63 edges and 179 vertex of which 6 / 179 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 176 transition count 973
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 153 transition count 971
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 151 transition count 971
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 51 place count 151 transition count 969
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 149 transition count 969
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 62 place count 142 transition count 962
Iterating global reduction 3 with 7 rules applied. Total rules applied 69 place count 142 transition count 962
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 139 transition count 958
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 139 transition count 958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 139 transition count 957
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 94 place count 130 transition count 948
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 130 transition count 946
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 105 place count 121 transition count 937
Iterating global reduction 5 with 9 rules applied. Total rules applied 114 place count 121 transition count 937
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 117 place count 118 transition count 934
Iterating global reduction 5 with 3 rules applied. Total rules applied 120 place count 118 transition count 934
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 123 place count 118 transition count 931
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 126 place count 118 transition count 928
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 136 place count 118 transition count 918
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 163 place count 108 transition count 901
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 185 place count 108 transition count 879
Applied a total of 185 rules in 517 ms. Remains 108 /179 variables (removed 71) and now considering 879/1002 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 108/179 places, 879/1002 transitions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 7) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 879 rows 108 cols
[2023-03-21 02:03:28] [INFO ] Computed 9 place invariants in 18 ms
[2023-03-21 02:03:29] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 02:03:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-21 02:03:29] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 02:03:29] [INFO ] State equation strengthened by 779 read => feed constraints.
[2023-03-21 02:03:30] [INFO ] After 472ms SMT Verify possible using 779 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 02:03:30] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 1 ms to minimize.
[2023-03-21 02:03:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2023-03-21 02:03:30] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 1 ms to minimize.
[2023-03-21 02:03:31] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 1 ms to minimize.
[2023-03-21 02:03:31] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 1 ms to minimize.
[2023-03-21 02:03:32] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 1 ms to minimize.
[2023-03-21 02:03:32] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 0 ms to minimize.
[2023-03-21 02:03:32] [INFO ] Deduced a trap composed of 14 places in 379 ms of which 1 ms to minimize.
[2023-03-21 02:03:33] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 1 ms to minimize.
[2023-03-21 02:03:33] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 0 ms to minimize.
[2023-03-21 02:03:34] [INFO ] Deduced a trap composed of 16 places in 343 ms of which 1 ms to minimize.
[2023-03-21 02:03:34] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 1 ms to minimize.
[2023-03-21 02:03:34] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 0 ms to minimize.
[2023-03-21 02:03:35] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 1 ms to minimize.
[2023-03-21 02:03:35] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 8 ms to minimize.
[2023-03-21 02:03:35] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5077 ms
[2023-03-21 02:03:35] [INFO ] After 6304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-21 02:03:36] [INFO ] After 7181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 14 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 64367 ms.

BK_STOP 1679364217579

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-07b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-07b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645500486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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