Execution Chart

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

Trace from the execution

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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 16:07:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:07:19] [INFO ] Load time of PNML (sax parser for PT used): 7320 ms
[2023-03-22 16:07:19] [INFO ] Transformed 400 places.
[2023-03-22 16:07:20] [INFO ] Transformed 136960 transitions.
[2023-03-22 16:07:20] [INFO ] Found NUPN structural information;
[2023-03-22 16:07:20] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 8190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 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
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3751 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 32 ms. (steps per millisecond=312 ) 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 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-22 16:07:25] [INFO ] Flow matrix only has 4582 transitions (discarded 33 similar events)
// Phase 1: matrix 4582 rows 400 cols
[2023-03-22 16:07:25] [INFO ] Computed 12 place invariants in 77 ms
[2023-03-22 16:07:26] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-22 16:07:26] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 16:07:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-22 16:07:29] [INFO ] After 2481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 16:07:30] [INFO ] State equation strengthened by 4247 read => feed constraints.
[2023-03-22 16:07:33] [INFO ] After 3108ms SMT Verify possible using 4247 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 16:07:35] [INFO ] Deduced a trap composed of 18 places in 2107 ms of which 9 ms to minimize.
[2023-03-22 16:07:37] [INFO ] Deduced a trap composed of 17 places in 1859 ms of which 1 ms to minimize.
[2023-03-22 16:07:39] [INFO ] Deduced a trap composed of 16 places in 1402 ms of which 2 ms to minimize.
[2023-03-22 16:07:40] [INFO ] Deduced a trap composed of 16 places in 1193 ms of which 2 ms to minimize.
[2023-03-22 16:07:42] [INFO ] Deduced a trap composed of 17 places in 1634 ms of which 2 ms to minimize.
[2023-03-22 16:07:43] [INFO ] Deduced a trap composed of 17 places in 1326 ms of which 2 ms to minimize.
[2023-03-22 16:07:45] [INFO ] Deduced a trap composed of 17 places in 1136 ms of which 1 ms to minimize.
[2023-03-22 16:07:46] [INFO ] Deduced a trap composed of 18 places in 954 ms of which 2 ms to minimize.
[2023-03-22 16:07:47] [INFO ] Deduced a trap composed of 18 places in 968 ms of which 2 ms to minimize.
[2023-03-22 16:07:48] [INFO ] Deduced a trap composed of 16 places in 809 ms of which 1 ms to minimize.
[2023-03-22 16:07:49] [INFO ] Deduced a trap composed of 16 places in 981 ms of which 1 ms to minimize.
[2023-03-22 16:07:50] [INFO ] Deduced a trap composed of 16 places in 793 ms of which 1 ms to minimize.
[2023-03-22 16:07:51] [INFO ] Deduced a trap composed of 17 places in 796 ms of which 1 ms to minimize.
[2023-03-22 16:07:51] [INFO ] Deduced a trap composed of 16 places in 631 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-22 16:07:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:07:51] [INFO ] After 25212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 150 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.49 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 4 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 2 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 20714 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 20718 ms. Remains : 240/400 places, 4380/4615 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4219 ms. (steps per millisecond=2 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 668497 steps, run timeout after 12001 ms. (steps per millisecond=55 ) properties seen :{0=1, 1=1, 3=1, 4=1, 6=1, 8=1}
Probabilistic random walk after 668497 steps, saw 99633 distinct states, run finished after 12004 ms. (steps per millisecond=55 ) properties seen :6
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-07 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 4380 rows 240 cols
[2023-03-22 16:08:29] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-22 16:08:29] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 16:08:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-22 16:08:31] [INFO ] After 1478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 16:08:31] [INFO ] State equation strengthened by 4222 read => feed constraints.
[2023-03-22 16:08:32] [INFO ] After 1207ms SMT Verify possible using 4222 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 16:08:35] [INFO ] Deduced a trap composed of 7 places in 2160 ms of which 2 ms to minimize.
[2023-03-22 16:08:37] [INFO ] Deduced a trap composed of 12 places in 1783 ms of which 1 ms to minimize.
[2023-03-22 16:08:39] [INFO ] Deduced a trap composed of 8 places in 2145 ms of which 1 ms to minimize.
[2023-03-22 16:08:41] [INFO ] Deduced a trap composed of 10 places in 2122 ms of which 1 ms to minimize.
[2023-03-22 16:08:43] [INFO ] Deduced a trap composed of 12 places in 1801 ms of which 0 ms to minimize.
[2023-03-22 16:08:45] [INFO ] Deduced a trap composed of 11 places in 1502 ms of which 1 ms to minimize.
[2023-03-22 16:08:46] [INFO ] Deduced a trap composed of 12 places in 1268 ms of which 1 ms to minimize.
[2023-03-22 16:08:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 13602 ms
[2023-03-22 16:08:47] [INFO ] Deduced a trap composed of 16 places in 1267 ms of which 1 ms to minimize.
[2023-03-22 16:08:49] [INFO ] Deduced a trap composed of 13 places in 1132 ms of which 0 ms to minimize.
[2023-03-22 16:08:50] [INFO ] Deduced a trap composed of 16 places in 923 ms of which 1 ms to minimize.
[2023-03-22 16:08:51] [INFO ] Deduced a trap composed of 15 places in 1302 ms of which 0 ms to minimize.
[2023-03-22 16:08:52] [INFO ] Deduced a trap composed of 14 places in 1095 ms of which 1 ms to minimize.
[2023-03-22 16:08:53] [INFO ] Deduced a trap composed of 15 places in 907 ms of which 1 ms to minimize.
[2023-03-22 16:08:54] [INFO ] Deduced a trap composed of 12 places in 911 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-22 16:08:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:08:54] [INFO ] After 25282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 39 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 4380/4380 transitions.
Graph (complete) has 757 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 238 transition count 4360
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 36 place count 224 transition count 4359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 223 transition count 4359
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 37 place count 223 transition count 4335
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 85 place count 199 transition count 4335
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 106 place count 178 transition count 4314
Iterating global reduction 3 with 21 rules applied. Total rules applied 127 place count 178 transition count 4314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 178 transition count 4312
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 140 place count 167 transition count 4301
Iterating global reduction 4 with 11 rules applied. Total rules applied 151 place count 167 transition count 4301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 157 place count 167 transition count 4295
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 185 place count 153 transition count 4281
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 197 place count 141 transition count 4269
Iterating global reduction 5 with 12 rules applied. Total rules applied 209 place count 141 transition count 4269
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 234 place count 141 transition count 4244
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 236 place count 139 transition count 4242
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 139 transition count 4242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 139 transition count 4241
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 240 place count 138 transition count 4240
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 138 transition count 4240
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 254 place count 138 transition count 4227
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 265 place count 138 transition count 4216
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 277 place count 127 transition count 4215
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 278 place count 127 transition count 4214
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 289 place count 127 transition count 4214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 290 place count 127 transition count 4213
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 295 place count 127 transition count 4208
Applied a total of 295 rules in 16663 ms. Remains 127 /240 variables (removed 113) and now considering 4208/4380 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16667 ms. Remains : 127/240 places, 4208/4380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5810 ms. (steps per millisecond=1 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 1000297 steps, run timeout after 15001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 1000297 steps, saw 134039 distinct states, run finished after 15004 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4208 rows 127 cols
[2023-03-22 16:09:32] [INFO ] Computed 12 place invariants in 25 ms
[2023-03-22 16:09:32] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:09:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 16:09:34] [INFO ] After 1255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:09:34] [INFO ] State equation strengthened by 4152 read => feed constraints.
[2023-03-22 16:09:35] [INFO ] After 1169ms SMT Verify possible using 4152 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:09:37] [INFO ] Deduced a trap composed of 6 places in 1976 ms of which 1 ms to minimize.
[2023-03-22 16:09:39] [INFO ] Deduced a trap composed of 8 places in 1938 ms of which 1 ms to minimize.
[2023-03-22 16:09:41] [INFO ] Deduced a trap composed of 8 places in 1934 ms of which 1 ms to minimize.
[2023-03-22 16:09:43] [INFO ] Deduced a trap composed of 7 places in 1677 ms of which 1 ms to minimize.
[2023-03-22 16:09:45] [INFO ] Deduced a trap composed of 8 places in 1411 ms of which 3 ms to minimize.
[2023-03-22 16:09:46] [INFO ] Deduced a trap composed of 11 places in 1220 ms of which 1 ms to minimize.
[2023-03-22 16:09:47] [INFO ] Deduced a trap composed of 9 places in 1052 ms of which 4 ms to minimize.
[2023-03-22 16:09:49] [INFO ] Deduced a trap composed of 8 places in 1201 ms of which 2 ms to minimize.
[2023-03-22 16:09:50] [INFO ] Deduced a trap composed of 7 places in 1043 ms of which 1 ms to minimize.
[2023-03-22 16:09:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 14486 ms
[2023-03-22 16:09:50] [INFO ] After 15764ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-22 16:09:50] [INFO ] After 17489ms SMT Verify possible using all constraints in natural domain returned unsat :2 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
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 158069 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/598/inv_0_ --invariant=/tmp/598/inv_1_ --invariant=/tmp/598/inv_2_ --invariant=/tmp/598/inv_3_ --invariant=/tmp/598/inv_4_ --invariant=/tmp/598/inv_5_ --invariant=/tmp/598/inv_6_ --invariant=/tmp/598/inv_7_ --invariant=/tmp/598/inv_8_ --invariant=/tmp/598/inv_9_ --invariant=/tmp/598/inv_10_ --invariant=/tmp/598/inv_11_ --invariant=/tmp/598/inv_12_ --invariant=/tmp/598/inv_13_ --invariant=/tmp/598/inv_14_ --invariant=/tmp/598/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11998412 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15920116 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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