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-167912645600526.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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645600526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 7.6K Feb 26 11:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 11:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 11:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 11:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 11:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 11:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:13 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 155M 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-10a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679387713474

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-10a
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 08:35:16] [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 08:35:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 08:35:24] [INFO ] Load time of PNML (sax parser for PT used): 7534 ms
[2023-03-21 08:35:24] [INFO ] Transformed 400 places.
[2023-03-21 08:35:25] [INFO ] Transformed 136960 transitions.
[2023-03-21 08:35:25] [INFO ] Found NUPN structural information;
[2023-03-21 08:35:25] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 8774 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 08:35:31] [INFO ] Flatten gal took : 903 ms
[2023-03-21 08:35:31] [INFO ] Flatten gal took : 479 ms
[2023-03-21 08:35:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11027466047941324143.gal : 236 ms
[2023-03-21 08:35:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11803993671607867832.prop : 3 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/ReachabilityCardinality11027466047941324143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11803993671607867832.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 ...330
Loading property file /tmp/ReachabilityCardinality11803993671607867832.prop.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4750 ms. (steps per millisecond=2 ) properties (out of 12) seen :3
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-21 08:35:35] [INFO ] Flow matrix only has 4582 transitions (discarded 33 similar events)
// Phase 1: matrix 4582 rows 400 cols
[2023-03-21 08:35:35] [INFO ] Computed 12 place invariants in 99 ms
[2023-03-21 08:35:36] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2023-03-21 08:35:36] [INFO ] After 788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 08:35:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :17 after 133
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :133 after 161
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :161 after 457
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :457 after 1057
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :1057 after 33615
[2023-03-21 08:35:40] [INFO ] After 3031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 08:35:40] [INFO ] State equation strengthened by 4247 read => feed constraints.
[2023-03-21 08:35:44] [INFO ] After 3279ms SMT Verify possible using 4247 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 08:35:46] [INFO ] Deduced a trap composed of 18 places in 2301 ms of which 11 ms to minimize.
[2023-03-21 08:35:48] [INFO ] Deduced a trap composed of 17 places in 1909 ms of which 2 ms to minimize.
[2023-03-21 08:35:50] [INFO ] Deduced a trap composed of 16 places in 1877 ms of which 16 ms to minimize.
[2023-03-21 08:35:52] [INFO ] Deduced a trap composed of 16 places in 1208 ms of which 3 ms to minimize.
[2023-03-21 08:35:54] [INFO ] Deduced a trap composed of 17 places in 2157 ms of which 1 ms to minimize.
[2023-03-21 08:35:56] [INFO ] Deduced a trap composed of 17 places in 1486 ms of which 1 ms to minimize.
[2023-03-21 08:35:57] [INFO ] Deduced a trap composed of 17 places in 1154 ms of which 1 ms to minimize.
[2023-03-21 08:35:58] [INFO ] Deduced a trap composed of 18 places in 963 ms of which 2 ms to minimize.
[2023-03-21 08:35:59] [INFO ] Deduced a trap composed of 18 places in 1002 ms of which 1 ms to minimize.
[2023-03-21 08:36:00] [INFO ] Deduced a trap composed of 16 places in 851 ms of which 1 ms to minimize.
[2023-03-21 08:36:01] [INFO ] Deduced a trap composed of 16 places in 1064 ms of which 0 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 08:36:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 08:36:01] [INFO ] After 25454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 113 ms.
Support contains 122 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Graph (complete) has 993 edges and 400 vertex of which 392 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.81 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 392 transition count 4560
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 29 rules applied. Total rules applied 77 place count 375 transition count 4548
Reduce places removed 2 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 12 rules applied. Total rules applied 89 place count 373 transition count 4538
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 101 place count 363 transition count 4536
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 101 place count 363 transition count 4494
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 185 place count 321 transition count 4494
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 217 place count 289 transition count 4462
Iterating global reduction 4 with 32 rules applied. Total rules applied 249 place count 289 transition count 4462
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 252 place count 289 transition count 4459
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 267 place count 274 transition count 4444
Iterating global reduction 5 with 15 rules applied. Total rules applied 282 place count 274 transition count 4444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 286 place count 274 transition count 4440
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 273 transition count 4439
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 273 transition count 4439
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 302 place count 266 transition count 4432
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 308 place count 260 transition count 4426
Iterating global reduction 6 with 6 rules applied. Total rules applied 314 place count 260 transition count 4426
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 315 place count 259 transition count 4425
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 259 transition count 4425
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 337 place count 259 transition count 4404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 338 place count 259 transition count 4403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 339 place count 258 transition count 4403
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 341 place count 257 transition count 4402
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 342 place count 256 transition count 4401
Iterating global reduction 8 with 1 rules applied. Total rules applied 343 place count 256 transition count 4401
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 344 place count 256 transition count 4400
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 360 place count 256 transition count 4384
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 376 place count 240 transition count 4384
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 377 place count 240 transition count 4383
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 383 place count 240 transition count 4383
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 386 place count 240 transition count 4380
Applied a total of 386 rules in 21659 ms. Remains 240 /400 variables (removed 160) and now considering 4380/4615 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21665 ms. Remains : 240/400 places, 4380/4615 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4428 ms. (steps per millisecond=2 ) properties (out of 9) seen :1
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 4380 rows 240 cols
[2023-03-21 08:36:28] [INFO ] Computed 8 place invariants in 44 ms
[2023-03-21 08:36:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 08:36:28] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 08:36:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-21 08:36:30] [INFO ] After 1944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 08:36:31] [INFO ] State equation strengthened by 4222 read => feed constraints.
[2023-03-21 08:36:33] [INFO ] After 2197ms SMT Verify possible using 4222 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 08:36:36] [INFO ] Deduced a trap composed of 11 places in 2211 ms of which 1 ms to minimize.
[2023-03-21 08:36:38] [INFO ] Deduced a trap composed of 8 places in 2452 ms of which 0 ms to minimize.
[2023-03-21 08:36:42] [INFO ] Deduced a trap composed of 14 places in 3198 ms of which 0 ms to minimize.
[2023-03-21 08:36:44] [INFO ] Deduced a trap composed of 7 places in 2083 ms of which 2 ms to minimize.
[2023-03-21 08:36:46] [INFO ] Deduced a trap composed of 12 places in 2096 ms of which 0 ms to minimize.
[2023-03-21 08:36:49] [INFO ] Deduced a trap composed of 16 places in 2729 ms of which 1 ms to minimize.
[2023-03-21 08:36:51] [INFO ] Deduced a trap composed of 12 places in 2128 ms of which 1 ms to minimize.
[2023-03-21 08:36:53] [INFO ] Deduced a trap composed of 15 places in 1885 ms of which 1 ms to minimize.
[2023-03-21 08:36:56] [INFO ] Deduced a trap composed of 9 places in 2541 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 08:36:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 08:36:56] [INFO ] After 27466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 130 ms.
Support contains 105 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 4380/4380 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 240 transition count 4378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 239 transition count 4378
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 3 place count 239 transition count 4372
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 15 place count 233 transition count 4372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 232 transition count 4371
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 232 transition count 4371
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 27 place count 227 transition count 4366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 225 transition count 4364
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 225 transition count 4364
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 225 transition count 4363
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 225 transition count 4361
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 223 transition count 4360
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 223 transition count 4360
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 223 transition count 4359
Applied a total of 40 rules in 13828 ms. Remains 223 /240 variables (removed 17) and now considering 4359/4380 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13829 ms. Remains : 223/240 places, 4359/4380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3990 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 693084 steps, run timeout after 12001 ms. (steps per millisecond=57 ) properties seen :{0=1, 1=1, 3=1, 5=1, 7=1}
Probabilistic random walk after 693084 steps, saw 104029 distinct states, run finished after 12008 ms. (steps per millisecond=57 ) properties seen :5
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 4359 rows 223 cols
[2023-03-21 08:37:26] [INFO ] Computed 9 place invariants in 38 ms
[2023-03-21 08:37:26] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 08:37:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-21 08:37:28] [INFO ] After 1450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 08:37:28] [INFO ] State equation strengthened by 4219 read => feed constraints.
[2023-03-21 08:37:30] [INFO ] After 1305ms SMT Verify possible using 4219 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 08:37:32] [INFO ] Deduced a trap composed of 13 places in 2108 ms of which 1 ms to minimize.
[2023-03-21 08:37:34] [INFO ] Deduced a trap composed of 16 places in 2116 ms of which 1 ms to minimize.
[2023-03-21 08:37:36] [INFO ] Deduced a trap composed of 11 places in 1795 ms of which 1 ms to minimize.
[2023-03-21 08:37:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 6366 ms
[2023-03-21 08:37:38] [INFO ] Deduced a trap composed of 13 places in 1754 ms of which 0 ms to minimize.
[2023-03-21 08:37:40] [INFO ] Deduced a trap composed of 7 places in 1743 ms of which 1 ms to minimize.
[2023-03-21 08:37:41] [INFO ] Deduced a trap composed of 15 places in 1539 ms of which 1 ms to minimize.
[2023-03-21 08:37:43] [INFO ] Deduced a trap composed of 10 places in 1396 ms of which 1 ms to minimize.
[2023-03-21 08:37:44] [INFO ] Deduced a trap composed of 12 places in 1328 ms of which 1 ms to minimize.
[2023-03-21 08:37:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 8380 ms
[2023-03-21 08:37:46] [INFO ] Deduced a trap composed of 12 places in 1206 ms of which 1 ms to minimize.
[2023-03-21 08:37:47] [INFO ] Deduced a trap composed of 9 places in 1148 ms of which 1 ms to minimize.
[2023-03-21 08:37:48] [INFO ] Deduced a trap composed of 10 places in 1011 ms of which 1 ms to minimize.
[2023-03-21 08:37:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 3769 ms
[2023-03-21 08:37:48] [INFO ] After 20016ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2023-03-21 08:37:48] [INFO ] After 21963ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 151936 ms.

BK_STOP 1679387870478

--------------------
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-10a"
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-10a, 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-167912645600526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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