fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r458-smll-167912650400526
Last Updated
May 14, 2023

About the Execution of Marcie+red for StigmergyCommit-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10965.199 3600000.00 3656490.00 59892.80 TTFFTTTFTFTFFTFF normal

Execution Chart

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

Trace from the execution

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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 18:35:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 18:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:35:57] [INFO ] Load time of PNML (sax parser for PT used): 7474 ms
[2023-03-22 18:35:58] [INFO ] Transformed 400 places.
[2023-03-22 18:35:58] [INFO ] Transformed 136960 transitions.
[2023-03-22 18:35:58] [INFO ] Found NUPN structural information;
[2023-03-22 18:35:58] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 8574 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 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 3822 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 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 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 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 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) 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 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 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-22 18:36:04] [INFO ] Flow matrix only has 4582 transitions (discarded 33 similar events)
// Phase 1: matrix 4582 rows 400 cols
[2023-03-22 18:36:05] [INFO ] Computed 12 place invariants in 131 ms
[2023-03-22 18:36:06] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2023-03-22 18:36:06] [INFO ] After 750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 18:36:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-22 18:36:10] [INFO ] After 3558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 18:36:11] [INFO ] State equation strengthened by 4247 read => feed constraints.
[2023-03-22 18:36:15] [INFO ] After 4189ms SMT Verify possible using 4247 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 18:36:18] [INFO ] Deduced a trap composed of 18 places in 2597 ms of which 12 ms to minimize.
[2023-03-22 18:36:20] [INFO ] Deduced a trap composed of 17 places in 2418 ms of which 2 ms to minimize.
[2023-03-22 18:36:22] [INFO ] Deduced a trap composed of 16 places in 1791 ms of which 4 ms to minimize.
[2023-03-22 18:36:24] [INFO ] Deduced a trap composed of 16 places in 1625 ms of which 1 ms to minimize.
[2023-03-22 18:36:27] [INFO ] Deduced a trap composed of 17 places in 2255 ms of which 3 ms to minimize.
[2023-03-22 18:36:28] [INFO ] Deduced a trap composed of 17 places in 1665 ms of which 1 ms to minimize.
[2023-03-22 18:36:30] [INFO ] Deduced a trap composed of 17 places in 1373 ms of which 1 ms to minimize.
[2023-03-22 18:36:31] [INFO ] Deduced a trap composed of 18 places in 1307 ms of which 3 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 18:36:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 18:36:31] [INFO ] After 25608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 193 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.77 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 5 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 3 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 21080 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 21083 ms. Remains : 240/400 places, 4380/4615 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4348 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 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 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 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) 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 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 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 679174 steps, run timeout after 12001 ms. (steps per millisecond=56 ) properties seen :{0=1, 1=1, 3=1, 4=1, 6=1, 8=1}
Probabilistic random walk after 679174 steps, saw 101244 distinct states, run finished after 12003 ms. (steps per millisecond=56 ) 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 18:37:10] [INFO ] Computed 8 place invariants in 32 ms
[2023-03-22 18:37:10] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 18:37:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-22 18:37:12] [INFO ] After 2065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 18:37:13] [INFO ] State equation strengthened by 4222 read => feed constraints.
[2023-03-22 18:37:14] [INFO ] After 1713ms SMT Verify possible using 4222 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 18:37:18] [INFO ] Deduced a trap composed of 7 places in 3025 ms of which 2 ms to minimize.
[2023-03-22 18:37:20] [INFO ] Deduced a trap composed of 12 places in 2217 ms of which 0 ms to minimize.
[2023-03-22 18:37:23] [INFO ] Deduced a trap composed of 8 places in 2586 ms of which 2 ms to minimize.
[2023-03-22 18:37:26] [INFO ] Deduced a trap composed of 10 places in 3183 ms of which 1 ms to minimize.
[2023-03-22 18:37:28] [INFO ] Deduced a trap composed of 12 places in 2278 ms of which 1 ms to minimize.
[2023-03-22 18:37:31] [INFO ] Deduced a trap composed of 11 places in 1925 ms of which 1 ms to minimize.
[2023-03-22 18:37:32] [INFO ] Deduced a trap composed of 12 places in 1726 ms of which 1 ms to minimize.
[2023-03-22 18:37:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 18033 ms
[2023-03-22 18:37:35] [INFO ] Deduced a trap composed of 16 places in 1902 ms of which 1 ms to minimize.
[2023-03-22 18:37:36] [INFO ] Deduced a trap composed of 13 places in 1620 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-22 18:37:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 18:37:36] [INFO ] After 26566ms 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 21 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.14 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 2 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 16943 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 16944 ms. Remains : 127/240 places, 4208/4380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5745 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 42 ms. (steps per millisecond=238 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 1027934 steps, run timeout after 15001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 1027934 steps, saw 137589 distinct states, run finished after 15006 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4208 rows 127 cols
[2023-03-22 18:38:14] [INFO ] Computed 12 place invariants in 25 ms
[2023-03-22 18:38:14] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 18:38:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-22 18:38:16] [INFO ] After 1692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 18:38:17] [INFO ] State equation strengthened by 4152 read => feed constraints.
[2023-03-22 18:38:18] [INFO ] After 1150ms SMT Verify possible using 4152 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 18:38:20] [INFO ] Deduced a trap composed of 6 places in 1947 ms of which 1 ms to minimize.
[2023-03-22 18:38:22] [INFO ] Deduced a trap composed of 8 places in 2158 ms of which 1 ms to minimize.
[2023-03-22 18:38:25] [INFO ] Deduced a trap composed of 8 places in 2154 ms of which 1 ms to minimize.
[2023-03-22 18:38:27] [INFO ] Deduced a trap composed of 7 places in 2480 ms of which 1 ms to minimize.
[2023-03-22 18:38:29] [INFO ] Deduced a trap composed of 8 places in 2059 ms of which 2 ms to minimize.
[2023-03-22 18:38:31] [INFO ] Deduced a trap composed of 11 places in 1808 ms of which 1 ms to minimize.
[2023-03-22 18:38:33] [INFO ] Deduced a trap composed of 9 places in 1622 ms of which 1 ms to minimize.
[2023-03-22 18:38:35] [INFO ] Deduced a trap composed of 8 places in 1854 ms of which 1 ms to minimize.
[2023-03-22 18:38:37] [INFO ] Deduced a trap composed of 7 places in 1277 ms of which 2 ms to minimize.
[2023-03-22 18:38:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 18601 ms
[2023-03-22 18:38:37] [INFO ] After 19855ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-22 18:38:37] [INFO ] After 22285ms 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 166909 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: StigmergyCommit_PT_10a
(NrP: 400 NrTr: 136960 NrArc: 3002181)

parse formulas
formulas created successfully
place and transition orderings generation:4m14.335sec

net check time: 0m 0.470sec

init dd package: 0m 3.317sec


RS generation: 26m57.758sec


-> reachability set: #nodes 945555 (9.5e+05) #states 2,595,299,911 (9)



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

checking: AG [~ [1<=p364]]
normalized: ~ [E [true U 1<=p364]]

abstracting: (1<=p364)
states: 9,765,625 (6)
MC time: 1m45.256sec

checking: AG [p40<=1]
normalized: ~ [E [true U ~ [p40<=1]]]

abstracting: (p40<=1)
states: 2,595,299,911 (9)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AG [~ [1<=p387]]
normalized: ~ [E [true U 1<=p387]]

abstracting: (1<=p387)
states: 1
MC time: 1m45.019sec

checking: EF [~ [p210<=p250]]
normalized: E [true U ~ [p210<=p250]]

abstracting: (p210<=p250)
states: 2,273,186,238 (9)
MC time: 1m38.045sec

checking: AG [p161<=p356]
normalized: ~ [E [true U ~ [p161<=p356]]]

abstracting: (p161<=p356)
states: 2,595,299,910 (9)
MC time: 1m31.055sec

checking: AG [~ [[~ [[[1<=p348 | p292<=0] & 1<=p353]] & 1<=p270]]]
normalized: ~ [E [true U [1<=p270 & ~ [[1<=p353 & [1<=p348 | p292<=0]]]]]]

abstracting: (p292<=0)
states: 2,585,534,286 (9)
abstracting: (1<=p348)
states: 1
abstracting: (1<=p353)
states: 1
abstracting: (1<=p270)
states: 1
MC time: 1m25.129sec

checking: AG [[p115<=p339 | p248<=p282]]
normalized: ~ [E [true U ~ [[p115<=p339 | p248<=p282]]]]

abstracting: (p248<=p282)
states: 2,284,000,657 (9)
abstracting: (p115<=p339)
states: 2,594,251,335 (9)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.769sec

checking: EF [[[1<=p186 & [[~ [[p281<=1 & ~ [[1<=p30 | 1<=p288]]]] & p310<=p260] | p265<=p399]] & ~ [[1<=p325 | p42<=1]]]]
normalized: E [true U [[1<=p186 & [[p310<=p260 & ~ [[~ [[1<=p30 | 1<=p288]] & p281<=1]]] | p265<=p399]] & ~ [[1<=p325 | p42<=1]]]]

abstracting: (p42<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p325)
states: 9,765,625 (6)
abstracting: (p265<=p399)
states: 2,595,299,911 (9)
abstracting: (p281<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p288)
states: 363,182,463 (8)
abstracting: (1<=p30)
states: 373,996,882 (8)
abstracting: (p310<=p260)
states: 2,595,299,910 (9)
abstracting: (1<=p186)
states: 1,048,576 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.772sec

checking: AG [~ [[[~ [[~ [p182<=0] & ~ [[p98<=p258 | p185<=0]]]] | [[p224<=0 & 1<=p119] | [1<=p277 & [p106<=p130 | ~ [p280<=1]]]]] & [[[~ [[p255<=p208 | 1<=p216]] & [[~ [p327<=0] & ~ [p221<=1]] | ~ [[p375<=p117 | 1<=p78]]]] & ~ [p360<=0]] & [p20<=1 & [~ [p213<=p174] & ~ [p46<=p269]]]]]]]
normalized: ~ [E [true U [[~ [[~ [[p98<=p258 | p185<=0]] & ~ [p182<=0]]] | [[1<=p277 & [p106<=p130 | ~ [p280<=1]]] | [p224<=0 & 1<=p119]]] & [[[~ [[p255<=p208 | 1<=p216]] & [[~ [p221<=1] & ~ [p327<=0]] | ~ [[p375<=p117 | 1<=p78]]]] & ~ [p360<=0]] & [p20<=1 & [~ [p46<=p269] & ~ [p213<=p174]]]]]]]

abstracting: (p213<=p174)
states: 2,284,000,657 (9)
abstracting: (p46<=p269)
states: 2,595,299,910 (9)
abstracting: (p20<=1)
states: 2,595,299,911 (9)
abstracting: (p360<=0)
states: 2,232,117,448 (9)
abstracting: (1<=p78)
states: 1,048,576 (6)
abstracting: (p375<=p117)
states: 2,595,299,910 (9)
abstracting: (p327<=0)
states: 2,585,534,286 (9)
abstracting: (p221<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p216)
states: 363,182,463 (8)
abstracting: (p255<=p208)
states: 2,585,534,286 (9)
abstracting: (1<=p119)
states: 1
abstracting: (p224<=0)
states: 2,595,299,910 (9)
abstracting: (p280<=1)
states: 2,595,299,911 (9)
abstracting: (p106<=p130)
states: 2,232,117,448 (9)
abstracting: (1<=p277)
states: 1
abstracting: (p182<=0)
states: 2,585,534,286 (9)
abstracting: (p185<=0)
states: 2,594,251,335 (9)
abstracting: (p98<=p258)
states: 2,595,299,910 (9)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.894sec

checking: AG [[~ [[[[~ [[1<=p95 | [p43<=p163 & p181<=1]]] & ~ [[~ [p8<=0] | [p356<=p391 | p93<=1]]]] & [1<=p240 | p389<=p68]] & [~ [[~ [1<=p225] | [[p341<=1 & p383<=1] | ~ [1<=p338]]]] & [[p121<=p305 & ~ [p60<=p379]] | ~ [[[p24<=1 & p373<=0] & ~ [p48<=p4]]]]]]] | ~ [p176<=p313]]]
normalized: ~ [E [true U ~ [[~ [p176<=p313] | ~ [[[[~ [[~ [p48<=p4] & [p24<=1 & p373<=0]]] | [p121<=p305 & ~ [p60<=p379]]] & ~ [[[~ [1<=p338] | [p341<=1 & p383<=1]] | ~ [1<=p225]]]] & [[1<=p240 | p389<=p68] & [~ [[[p356<=p391 | p93<=1] | ~ [p8<=0]]] & ~ [[1<=p95 | [p43<=p163 & p181<=1]]]]]]]]]]]

abstracting: (p181<=1)
states: 2,595,299,911 (9)
abstracting: (p43<=p163)
states: 2,594,251,335 (9)
abstracting: (1<=p95)
states: 1
abstracting: (p8<=0)
states: 2,595,299,910 (9)
abstracting: (p93<=1)
states: 2,595,299,911 (9)
abstracting: (p356<=p391)
states: 2,272,471,055 (9)
abstracting: (p389<=p68)
states: 2,595,299,910 (9)
abstracting: (1<=p240)
states: 1
abstracting: (1<=p225)
states: 1
abstracting: (p383<=1)
states: 2,595,299,911 (9)
abstracting: (p341<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p338)
states: 1
abstracting: (p60<=p379)
states: 2,595,299,910 (9)
abstracting: (p121<=p305)
states: 2,595,299,910 (9)
abstracting: (p373<=0)
states: 2,595,299,910 (9)
abstracting: (p24<=1)
states: 2,595,299,911 (9)
abstracting: (p48<=p4)
states: 2,595,299,910 (9)
abstracting: (p176<=p313)
states: 2,232,117,448 (9)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.268sec

checking: EF [~ [[~ [[[~ [[[[1<=p122 | 1<=p163] | ~ [1<=p321]] & [p217<=1 | [p154<=p144 | 1<=p292]]]] & p352<=p384] | ~ [[[[[1<=p327 | 1<=p238] & [p388<=p84 & p238<=p278]] & [p267<=0 | [1<=p370 & 1<=p186]]] & [~ [p61<=p91] | [[p176<=0 & p220<=p286] | ~ [1<=p249]]]]]]] | p259<=p141]]]
normalized: E [true U ~ [[~ [[[~ [[[p217<=1 | [p154<=p144 | 1<=p292]] & [~ [1<=p321] | [1<=p122 | 1<=p163]]]] & p352<=p384] | ~ [[[[p267<=0 | [1<=p370 & 1<=p186]] & [[p388<=p84 & p238<=p278] & [1<=p327 | 1<=p238]]] & [~ [p61<=p91] | [~ [1<=p249] | [p176<=0 & p220<=p286]]]]]]] | p259<=p141]]]

abstracting: (p259<=p141)
states: 2,594,251,335 (9)
abstracting: (p220<=p286)
states: 2,585,534,286 (9)
abstracting: (p176<=0)
states: 2,232,117,448 (9)
abstracting: (1<=p249)
states: 363,182,463 (8)
abstracting: (p61<=p91)
states: 2,595,299,910 (9)
abstracting: (1<=p238)
states: 1
abstracting: (1<=p327)
states: 9,765,625 (6)
abstracting: (p238<=p278)
states: 2,595,299,910 (9)
abstracting: (p388<=p84)
states: 2,595,299,910 (9)
abstracting: (1<=p186)
states: 1,048,576 (6)
abstracting: (1<=p370)
states: 1
abstracting: (p267<=0)
states: 2,595,299,910 (9)
abstracting: (p352<=p384)
states: 2,595,299,910 (9)
abstracting: (1<=p163)
states: 1
abstracting: (1<=p122)
states: 1
abstracting: (1<=p321)
states: 363,182,463 (8)
abstracting: (1<=p292)
states: 9,765,625 (6)
abstracting: (p154<=p144)
states: 2,595,299,910 (9)
abstracting: (p217<=1)
states: 2,595,299,911 (9)
MC time: 1m45.033sec

checking: EF [[[~ [[~ [[[p208<=p104 | p317<=p239] & p259<=1]] & ~ [p335<=1]]] | 1<=p397] & [[[[p151<=p197 & [[~ [[1<=p38 & p97<=p347]] & ~ [1<=p223]] & [1<=p242 & ~ [[p234<=1 | p37<=0]]]]] | p209<=p126] | [~ [p57<=1] & ~ [[[1<=p246 | p113<=p167] | p45<=p199]]]] & [p19<=p84 & 1<=p279]]]]
normalized: E [true U [[1<=p397 | ~ [[~ [[p259<=1 & [p208<=p104 | p317<=p239]]] & ~ [p335<=1]]]] & [[[p209<=p126 | [p151<=p197 & [[~ [[1<=p38 & p97<=p347]] & ~ [1<=p223]] & [1<=p242 & ~ [[p234<=1 | p37<=0]]]]]] | [~ [[p45<=p199 | [1<=p246 | p113<=p167]]] & ~ [p57<=1]]] & [p19<=p84 & 1<=p279]]]]

abstracting: (1<=p279)
states: 1
abstracting: (p19<=p84)
states: 2,595,299,910 (9)
abstracting: (p57<=1)
states: 2,595,299,911 (9)
abstracting: (p113<=p167)
states: 2,594,251,335 (9)
abstracting: (1<=p246)
states: 373,996,882 (8)
abstracting: (p45<=p199)
states: 2,595,299,910 (9)
abstracting: (p37<=0)
states: 2,585,534,286 (9)
abstracting: (p234<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p242)
states: 1
abstracting: (1<=p223)
states: 1,048,576 (6)
abstracting: (p97<=p347)
states: 2,595,299,910 (9)
abstracting: (1<=p38)
states: 9,765,625 (6)
abstracting: (p151<=p197)
states: 2,594,251,335 (9)
abstracting: (p209<=p126)
states: 2,595,299,910 (9)
abstracting: (p335<=1)
states: 2,595,299,911 (9)
abstracting: (p317<=p239)
states: 2,595,299,910 (9)
abstracting: (p208<=p104)
states: 2,595,299,910 (9)
abstracting: (p259<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p397)
states: 282,475,249 (8)
MC time: 1m36.084sec

checking: AG [[p200<=0 | [[1<=p155 | [[1<=p64 & [~ [p3<=0] | p45<=p35]] & [1<=p69 & [~ [[~ [p81<=p339] & [p281<=p236 & p119<=p105]]] & p43<=p352]]]] & [1<=p39 | [p342<=p124 & [~ [[~ [1<=p94] | [p1<=p251 | p258<=0]]] | [[~ [[1<=p391 & 1<=p204]] | [[p329<=0 | p348<=p353] & [p28<=p337 | p302<=1]]] & [p213<=p104 & [[p186<=1 | p388<=1] | p73<=p9]]]]]]]]]
normalized: ~ [E [true U ~ [[p200<=0 | [[1<=p155 | [[1<=p64 & [p45<=p35 | ~ [p3<=0]]] & [1<=p69 & [p43<=p352 & ~ [[[p281<=p236 & p119<=p105] & ~ [p81<=p339]]]]]]] & [1<=p39 | [p342<=p124 & [~ [[~ [1<=p94] | [p1<=p251 | p258<=0]]] | [[p213<=p104 & [p73<=p9 | [p186<=1 | p388<=1]]] & [[[p28<=p337 | p302<=1] & [p329<=0 | p348<=p353]] | ~ [[1<=p391 & 1<=p204]]]]]]]]]]]]

abstracting: (1<=p204)
states: 1
abstracting: (1<=p391)
states: 282,475,249 (8)
abstracting: (p348<=p353)
states: 2,595,299,910 (9)
abstracting: (p329<=0)
states: 2,594,251,335 (9)
abstracting: (p302<=1)
states: 2,595,299,911 (9)
abstracting: (p28<=p337)
states: 2,595,299,910 (9)
abstracting: (p388<=1)
states: 2,595,299,911 (9)
abstracting: (p186<=1)
states: 2,595,299,911 (9)
abstracting: (p73<=p9)
states: 2,585,534,286 (9)
abstracting: (p213<=p104)
states: 2,284,000,657 (9)
abstracting: (p258<=0)
states: 2,594,251,335 (9)
abstracting: (p1<=p251)
states: 2,585,534,286 (9)
abstracting: (1<=p94)
states: 1
abstracting: (p342<=p124)
states: 2,595,299,910 (9)
abstracting: (1<=p39)
states: 9,765,625 (6)
abstracting: (p81<=p339)
states: 2,595,299,910 (9)
abstracting: (p119<=p105)
states: 2,595,299,910 (9)
abstracting: (p281<=p236)
states: 2,595,299,910 (9)
abstracting: (p43<=p352)
states: 2,594,251,335 (9)
abstracting: (1<=p69)
states: 363,182,463 (8)
abstracting: (p3<=0)
states: 2,585,534,286 (9)
abstracting: (p45<=p35)
states: 2,595,299,910 (9)
abstracting: (1<=p64)
states: 1
abstracting: (1<=p155)
states: 1
abstracting: (p200<=0)
states: 2,595,299,910 (9)

before gc: list nodes free: 118491

after gc: idd nodes used:4773220, unused:59226780; list nodes free:247803416
MC time: 1m27.108sec

checking: AG [~ [[[[~ [[[p261<=p127 & ~ [1<=p62]] | 1<=p247]] & ~ [p134<=1]] & [[[[~ [[p392<=0 & 1<=p293]] | ~ [p233<=p163]] & [~ [[p68<=p100 & 1<=p375]] & ~ [1<=p246]]] & [~ [p175<=0] | 1<=p333]] & 1<=p18]] & [p281<=p264 | [[[[[[p353<=0 & p34<=0] | [p62<=0 & 1<=p139]] & 1<=p17] | [[[p44<=0 & 1<=p379] & 1<=p17] | [1<=p258 & ~ [p367<=p60]]]] | [[~ [[p285<=0 | p123<=1]] & [p39<=p116 | [p133<=p94 & p160<=p99]]] & p393<=1]] | p133<=1]]]]]
normalized: ~ [E [true U [[p281<=p264 | [p133<=1 | [[p393<=1 & [[p39<=p116 | [p133<=p94 & p160<=p99]] & ~ [[p285<=0 | p123<=1]]]] | [[1<=p17 & [[p62<=0 & 1<=p139] | [p353<=0 & p34<=0]]] | [[1<=p17 & [p44<=0 & 1<=p379]] | [1<=p258 & ~ [p367<=p60]]]]]]] & [[1<=p18 & [[[~ [[p392<=0 & 1<=p293]] | ~ [p233<=p163]] & [~ [[p68<=p100 & 1<=p375]] & ~ [1<=p246]]] & [1<=p333 | ~ [p175<=0]]]] & [~ [[1<=p247 | [p261<=p127 & ~ [1<=p62]]]] & ~ [p134<=1]]]]]]

abstracting: (p134<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p62)
states: 1
abstracting: (p261<=p127)
states: 2,595,299,910 (9)
abstracting: (1<=p247)
states: 363,182,463 (8)
abstracting: (p175<=0)
states: 2,232,117,448 (9)
abstracting: (1<=p333)
states: 1
abstracting: (1<=p246)
states: 373,996,882 (8)
abstracting: (1<=p375)
states: 1
abstracting: (p68<=p100)
states: 2,232,117,448 (9)
abstracting: (p233<=p163)
states: 2,595,299,910 (9)
abstracting: (1<=p293)
states: 1,048,576 (6)
abstracting: (p392<=0)
states: 2,312,824,662 (9)
abstracting: (1<=p18)
states: 1
abstracting: (p367<=p60)
states: 2,594,251,335 (9)
abstracting: (1<=p258)
states: 1,048,576 (6)
abstracting: (1<=p379)
states: 1
abstracting: (p44<=0)
states: 2,595,299,910 (9)
abstracting: (1<=p17)
states: 1
abstracting: (p34<=0)
states: 2,232,117,448 (9)
abstracting: (p353<=0)
states: 2,595,299,910 (9)
abstracting: (1<=p139)
states: 363,182,463 (8)
abstracting: (p62<=0)
states: 2,595,299,910 (9)
abstracting: (1<=p17)
states: 1
abstracting: (p123<=1)
states: 2,595,299,911 (9)
abstracting: (p285<=0)
states: 2,232,117,448 (9)
abstracting: (p160<=p99)
states: 2,595,299,910 (9)
abstracting: (p133<=p94)
states: 2,595,299,910 (9)
abstracting: (p39<=p116)
states: 2,585,534,286 (9)
abstracting: (p393<=1)
states: 2,595,299,911 (9)
abstracting: (p133<=1)
states: 2,595,299,911 (9)
abstracting: (p281<=p264)
states: 2,595,299,910 (9)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.635sec

checking: EF [[[1<=p18 | p195<=p155] & [[p267<=0 & [[[[p78<=p118 & [~ [1<=p352] | p293<=p55]] | [~ [p246<=p51] | p210<=p75]] & [[[[p17<=p196 | 1<=p315] | ~ [p85<=p21]] | [1<=p95 | p257<=p227]] & [[~ [p295<=1] | [p17<=1 & p196<=p388]] | ~ [p41<=p176]]]] & ~ [[[[1<=p188 & [p97<=1 & 1<=p211]] & p13<=p378] | [[p262<=p350 & [1<=p100 | p378<=1]] | p58<=0]]]]] & [~ [p325<=p72] | [p280<=p188 & 1<=p64]]]]]
normalized: E [true U [[[[[[[[1<=p95 | p257<=p227] | [~ [p85<=p21] | [p17<=p196 | 1<=p315]]] & [~ [p41<=p176] | [[p17<=1 & p196<=p388] | ~ [p295<=1]]]] & [[~ [p246<=p51] | p210<=p75] | [[~ [1<=p352] | p293<=p55] & p78<=p118]]] & ~ [[[[[1<=p100 | p378<=1] & p262<=p350] | p58<=0] | [[[p97<=1 & 1<=p211] & 1<=p188] & p13<=p378]]]] & p267<=0] & [[p280<=p188 & 1<=p64] | ~ [p325<=p72]]] & [1<=p18 | p195<=p155]]]

abstracting: (p195<=p155)
states: 2,595,299,910 (9)
abstracting: (1<=p18)
states: 1
abstracting: (p325<=p72)
states: 2,585,534,286 (9)
abstracting: (1<=p64)
states: 1
abstracting: (p280<=p188)
states: 2,595,299,910 (9)
abstracting: (p267<=0)
states: 2,595,299,910 (9)
abstracting: (p13<=p378)
states: 2,595,299,910 (9)
abstracting: (1<=p188)
states: 1
abstracting: (1<=p211)
states: 363,182,463 (8)
abstracting: (p97<=1)
states: 2,595,299,911 (9)
abstracting: (p58<=0)
states: 2,595,299,910 (9)
abstracting: (p262<=p350)
states: 2,595,299,910 (9)
abstracting: (p378<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p100)
states: 1
abstracting: (p78<=p118)
states: 2,594,251,335 (9)
abstracting: (p293<=p55)
states: 2,594,251,335 (9)
abstracting: (1<=p352)
states: 1
abstracting: (p210<=p75)
states: 2,223,256,154 (9)
abstracting: (p246<=p51)
states: 2,221,303,030 (9)
abstracting: (p295<=1)
states: 2,595,299,911 (9)
abstracting: (p196<=p388)
states: 2,595,299,910 (9)
abstracting: (p17<=1)
states: 2,595,299,911 (9)
abstracting: (p41<=p176)
states: 2,594,251,335 (9)
abstracting: (1<=p315)
states: 1
abstracting: (p17<=p196)
states: 2,595,299,910 (9)
abstracting: (p85<=p21)
states: 2,595,299,910 (9)
abstracting: (p257<=p227)
states: 2,594,251,335 (9)
abstracting: (1<=p95)
states: 1
-> the formula is FALSE

FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.998sec

checking: AG [[[~ [p329<=p217] | [[[[p339<=1 & [[~ [p29<=p85] & [1<=p209 & p180<=1]] & [[1<=p295 | p327<=p230] | [p262<=p227 & p85<=1]]]] & ~ [1<=p119]] & p312<=0] & [[~ [[p237<=p284 | [[p342<=1 | 1<=p379] | 1<=p42]]] | [[[[p273<=0 | 1<=p347] | [p49<=1 & p79<=p60]] & [~ [p37<=0] & [1<=p27 & p28<=p356]]] & [p383<=p121 | [~ [1<=p77] | [p357<=p353 & p221<=p335]]]]] | [~ [1<=p256] | [[[1<=p305 | [1<=p224 | p217<=p170]] | [[p366<=0 & 1<=p47] | [p76<=1 & p124<=p51]]] & p297<=1]]]]] | [[1<=p250 | [p363<=p80 & ~ [[[[[p120<=1 | 1<=p129] & ~ [p135<=1]] | [~ [p1<=p149] | [1<=p373 | p389<=p223]]] | p224<=0]]]] | p170<=p156]]]
normalized: ~ [E [true U ~ [[[[[[[p297<=1 & [[1<=p305 | [1<=p224 | p217<=p170]] | [[p76<=1 & p124<=p51] | [p366<=0 & 1<=p47]]]] | ~ [1<=p256]] | [[[p383<=p121 | [[p357<=p353 & p221<=p335] | ~ [1<=p77]]] & [[[1<=p27 & p28<=p356] & ~ [p37<=0]] & [[p49<=1 & p79<=p60] | [p273<=0 | 1<=p347]]]] | ~ [[p237<=p284 | [1<=p42 | [p342<=1 | 1<=p379]]]]]] & [[~ [1<=p119] & [p339<=1 & [[[p262<=p227 & p85<=1] | [1<=p295 | p327<=p230]] & [[1<=p209 & p180<=1] & ~ [p29<=p85]]]]] & p312<=0]] | ~ [p329<=p217]] | [p170<=p156 | [1<=p250 | [p363<=p80 & ~ [[p224<=0 | [[[1<=p373 | p389<=p223] | ~ [p1<=p149]] | [~ [p135<=1] & [p120<=1 | 1<=p129]]]]]]]]]]]]

abstracting: (1<=p129)
states: 1
abstracting: (p120<=1)
states: 2,595,299,911 (9)
abstracting: (p135<=1)
states: 2,595,299,911 (9)
abstracting: (p1<=p149)
states: 2,585,534,286 (9)
abstracting: (p389<=p223)
states: 2,595,299,910 (9)
abstracting: (1<=p373)
states: 1
abstracting: (p224<=0)
states: 2,595,299,910 (9)
abstracting: (p363<=p80)
states: 2,585,534,286 (9)
abstracting: (1<=p250)
states: 363,182,463 (8)
abstracting: (p170<=p156)
states: 2,595,299,910 (9)
abstracting: (p329<=p217)
states: 2,594,251,335 (9)
abstracting: (p312<=0)
states: 2,595,299,910 (9)
abstracting: (p29<=p85)
states: 2,595,299,910 (9)
abstracting: (p180<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p209)
states: 1
abstracting: (p327<=p230)
states: 2,585,534,286 (9)
abstracting: (1<=p295)
states: 1,048,576 (6)
abstracting: (p85<=1)
states: 2,595,299,911 (9)
abstracting: (p262<=p227)
states: 2,595,299,910 (9)
abstracting: (p339<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p119)
states: 1
abstracting: (1<=p379)
states: 1
abstracting: (p342<=1)
states: 2,595,299,911 (9)
abstracting: (1<=p42)
states: 1,048,576 (6)
abstracting: (p237<=p284)
states: 2,595,299,910 (9)
abstracting: (1<=p347)
states: 1
abstracting: (p273<=0)
states: 2,595,299,910 (9)
abstracting: (p79<=p60)
states: 2,594,251,335 (9)
abstracting: (p49<=1)
states: 2,595,299,911 (9)
abstracting: (p37<=0)
states: 2,585,534,286 (9)
abstracting: (p28<=p356)
states: 2,595,299,910 (9)
abstracting: (1<=p27)
states: 1
abstracting: (1<=p77)
states: 1,048,576 (6)
abstracting: (p221<=p335)
states: 2,594,251,335 (9)
abstracting: (p357<=p353)
states: 2,232,117,448 (9)
abstracting: (p383<=p121)
states: 2,595,299,910 (9)
abstracting: (1<=p256)
states: 9,765,625 (6)
abstracting: (1<=p47)
states: 1
abstracting: (p366<=0)
states: 2,594,251,335 (9)
abstracting: (p124<=p51)
states: 2,595,299,910 (9)
abstracting: (p76<=1)
states: 2,595,299,911 (9)
abstracting: (p217<=p170)
states: 2,585,534,286 (9)
abstracting: (1<=p224)
states: 1
abstracting: (1<=p305)
states: 1
abstracting: (p297<=1)
states: 2,595,299,911 (9)
MC time: 1m32.020sec

checking: AG [~ [1<=p364]]
normalized: ~ [E [true U 1<=p364]]

abstracting: (1<=p364)
states: 9,765,625 (6)

before gc: list nodes free: 505377

after gc: idd nodes used:7503413, unused:56496587; list nodes free:236017857
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5006916 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15925068 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 2.727sec

508969 574346 595266 615845 636298 654712 670968 694349 703890 703901 703924 703924 704150 704267 704291 704293 704428 704451 704472 704493 704472 704818 704843 704853 704841 705045 705065 705086 705068 705064 705401 705422 705444 705424 705421 705540 705561 705637 705638 705598 705680 705997 705997 706007 706171 706196 706229 706232 706187 706518 706542 706583 706593 706577 706728 706752 706796 706849 706831 706813 707175 707198 707219 707249 707237 707346 707369 707414 707466 707468 707431 707377 707564 707585 707682 707692 707680 707669 707769 707813 707853 708013 708014 707993 707934 707935 708289 708289 708318 708465 708490 708523 708528 708489 708824 708850 708890 708900 708883 709054 709079 709122 709174 709158 709132 709095 709581 709601 709632 709620 709616 709791 709811 709888 709891 709872 709810 710055 710099 710137 710197 710195 710191 710322 710346 710390 710452 710567 710549 710531 710391 710866 710889 710930 710940 710925 711037 711060 711105 711157 711141 711128 711080 711271 711292 711389 711399 711384 711374 711476 711520 711544 711720 711722 711702 711631 711545 711753 711774 711814 711881 711869 711858 711958 711981 712042 712090 712205 712186 712137 712037 712113 712157 712197 712392 712402 712390 712379 712359 712446 712467 712555 712679 712899 712879 712860 712706 712627 712853 712908 713082 713092 713078 713426 713468 713500 713707 713716 713720 713655 714170 714189 714448 714458 714463 714434 714772 714797 714850 714908 715180 715178 715174 715035 715606 715650 715694 715890 715905 715918 715878 716204 716224 716316 716568 716571 716576 716576 716428 716796 716816 716936 717209 717219 717237 717261 717459 717483 717503 717609 717719 718095 718094 718093 718083 717759 718233 718277 718321 718477 718492 718506 718691 718714 718735 718827 719039 719040 719048 719048 719129 719152 719211 719293 719526 719541 719555 719579 719700 719723 719778 719850 719960 720298 720295 720285 720285 719962 720132 720153 720193 720506 720516 720535 720561 720480 720703 720724 720832 720944 721276 721277 721277 721275 720962 721006 721050 721090 721326 721647 721657 721676 721702 721750 721677 721700 721761 721829 721973 722705 722706 722700 722694 722668 722062 721988 722017 722099 722689 722699 722715 722681 723446 723488 723526 723594 724187 724186 724173 724031 724854 724880 724944 725034 725638 725653 725665 725610 726290 726315 726368 726438 726562 727272 727270 727266 727235 726937 727746 727790 727834 727922 728478 728483 728496 728444 729048 729072 729126 729196 729320 729973 729971 729966 729938 729642 730208 730228 730266 730512 731211 731221 731239 731263 731147 731711 731735 731789 731861 731995 733129 733131 733128 733117 733105 732409 732885 732908 732929 733061 733489 733499 733518 733539 733469 733940 733961 734065 734189 734721 734722 734724 734718 734397 734745 734768 734827 734909 735073 735664 735669 735683 735744 735594 736002 736046 736080 736286 736522 737302 737301 737301 737291 737208 736586 736657 736701 736741 736993 737566 737576 737595 737621 737660 737914 737937 737958 738066 738202 738442 739217 739215 739215 739201 739140 738518 738541 738562 738678 738838 739158 740014 740019 740033 740107 740178 739872 740183 740204 740312 740456 740720 742420 742421 742417 742409 742383 742170 740978 740432 740462 740544 740655 741607 741623 741639 741671 741591 742704 742722 742765 742975 744032 744040 744110 744072 744112 743856 745001 745020 745065 745335 746441 746451 746457 746499 746557 746385 747433 747476 747513 747753 747977 749282 749285 749282 749299 749316 748746 749639 749663 749727 749815 749991 751104 751120 751134 751164 751056 752112 752136 752192 752272 752432 752656 753972 753971 753981 754005 754041 753441 754208 754252 754290 754536 754864 756282 756292 756312 756338 756506 756154 757130 757154 757210 757284 757438 758170 759979 759981 759979 759973 759983 759995 758667 758919 758942 759007 759095 759271 760243 760259 760274 760367 760203 761099 761122 761179 761259 761419 761643 762818 762817 762828 762853 762891 762295 762883 762927 762965 763211 763539 764816 764826 764847 764873 764930 764696 765512 765535 765592 765666 765820 766552 768220 768222 768220 768215 768225 768240 766916 766835 766858 766919 767003 767171 767507 768778 768784 768827 768886 769004 768664 769464 769508 769548 769776 770088 770520 772172 772174 772175 772187 772202 772232 770948 770823 770844 770884 771120 771440 772080 773634 773650 773665 773745 773856 774078 773690 773713 773734 773846 773994 774298 775738 778062 778063 778060 778055 778037 777988 777914 775188 773327 773398 773440 773551 773774 775244 775254 775276 775308 775340 775212 776780 776823 776866 776952 777372 779043 779052 779057 779091 779139 779139 778755 780220 780265 780310 780400 780580 780940 782726 782732 782745 782832 782884 782604 784092 784117 784172 784252 784412 785180 787347 787350 787349 787368 787389 787431 787323 786339 787180 787224 787268 787532 787884 789675 789685 789691 789735 789795 789851 789579 791083 791127 791163 791243 791659 792171 794354 794357 794356 794376 794398 794442 793362 794123 794147 794167 794287 794451 794779 795435 797835 797851 797865 797891 798059 798155 797579 798923 798947 799003 799077 799231 800027 801003 804178 804180 804178 804172 804186 804210 803858 801618 801004 801027 801092 801180 801356 801708 803483 803493 803514 803545 803607 803403 804891 804914 804935 804971 805211 805467 805979 808146 808149 808161 808169 808238 808138 807170 807915 807938 807959 808079 808243 808571 809227 811611 811627 811642 811668 811839 811939 811371 812699 812722 812779 812853 813007 813803 814779 817938 817940 817938 817933 817947 817974 817626 815394 814667 814690 814765 814835 815003 815339 816011 818363 818379 818394 818481 818599 818707 818155 819451 819474 819535 819607 820075 820571 821563 824690 824693 824692 824705 824709 824766 824458 822306 821579 821602 821663 821739 821899 822859 824139 826945 826955 826961 827004 827056 827167 827577 826417 826625 826648 826669 826781 826929 827233 828801 830721 835064 835065 835062 835057 835039 834998 834932 834032 829269 824545 824577 824659 824770 824993 825440 829543 829553 829559 829607 829639 829719 829479 833673 833698 833716 833845 833985 834281 834857 839220 839226 839228 839244 839268 839220 839172 838260 842033 842059 842123 842213 842393 842753 843473 848041 848051 848070 848099 848157 848209 847817 847817 851713 851756 851793 851873 852289 852833 853889 859232 859235 859234 859232 859250 859268 859112 858896 856832 859249 859273 859337 859425 859601 859953 860657 865096 865106 865126 865156 865216 865416 864904 868672 868672 868716 868752 868992 869248 869792 870848 876063 876066 876065 876073 876083 876103 875951 873695 873695 875888 875932 875970 876052 876544 877200 878512 884168 884178 884184 884198 884280 884392 884488 884744 883656 887104 887128 887184 887258 887720 888208 889248 891264 898463 898465 898463 898457 898459 898455 898047 897439 892959 892209 892209 892253 892297 892561 892913 893617 897568 897568 897584 897599 897692 897752 897904 897408 900688 900711 900732 900848 901008 901264 901808 902864 907591 907594 907600 907602 907613 907487 907287 905255 906960 906960 907004 907042 907288 907616 908272 909584 914752 914762 914768 914809 914866 914980 915080 915344 914272 917232 917255 917312 917386 917848 918336 919376 921392 928103 928105 928103 928098 928100 928097 927695 927095 922631 921296 921319 921340 921380 921632 921968 922640 923984 929088 929098 929104 929147 929206 929324 929712 928672 928672 931568 931612 931652 931724 932192 932688 933744 935792 942439 942442 942441 942448 942446 942467 942111 941591 937287 936048 936071 936092 936208 936368 936688 937328 938608 941168 947939 947949 947970 947998 948161 948383 948571 949075 946883 948371 948394 948455 948527 948675 949587 950547 952595 956563 966410 966411 966408 966403 966385 966320 966230 965282 963770 954311 945555
iterations count:113272172 (827), effective:5398 (0)

initing FirstDep: 0m 2.851sec


sat_reach.icc:155: Timeout: after 104 sec


sat_reach.icc:155: Timeout: after 104 sec


sat_reach.icc:155: Timeout: after 97 sec


sat_reach.icc:155: Timeout: after 90 sec


sat_reach.icc:155: Timeout: after 84 sec

170605
sat_reach.icc:155: Timeout: after 104 sec


sat_reach.icc:155: Timeout: after 95 sec


sat_reach.icc:155: Timeout: after 86 sec


sat_reach.icc:155: Timeout: after 91 sec

892378

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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