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

About the Execution of Smart+red for StigmergyCommit-PT-11a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5794.115 3388989.00 3505879.00 7268.50 FTFT?TFFTFTTTFTT 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.r459-smll-167912651400542.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 smartxred
Input is StigmergyCommit-PT-11a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651400542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 8.1K Feb 26 11:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 11:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Feb 26 11:38 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 464M 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-11a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679418004255

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-11a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 17:00:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 17:00:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 17:00:27] [INFO ] Load time of PNML (sax parser for PT used): 20322 ms
[2023-03-21 17:00:28] [INFO ] Transformed 436 places.
[2023-03-21 17:00:29] [INFO ] Transformed 373236 transitions.
[2023-03-21 17:00:29] [INFO ] Found NUPN structural information;
[2023-03-21 17:00:29] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 22624 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14223 ms. (steps per millisecond=0 ) properties (out of 10) seen :2
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :2
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-21 17:00:47] [INFO ] Flow matrix only has 8722 transitions (discarded 36 similar events)
// Phase 1: matrix 8722 rows 436 cols
[2023-03-21 17:00:48] [INFO ] Computed 13 place invariants in 217 ms
[2023-03-21 17:00:49] [INFO ] After 684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 17:00:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-21 17:00:54] [INFO ] After 5072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 17:00:57] [INFO ] State equation strengthened by 8357 read => feed constraints.
[2023-03-21 17:01:02] [INFO ] After 4985ms SMT Verify possible using 8357 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 17:01:08] [INFO ] Deduced a trap composed of 17 places in 5867 ms of which 12 ms to minimize.
[2023-03-21 17:01:13] [INFO ] Deduced a trap composed of 17 places in 4798 ms of which 7 ms to minimize.
[2023-03-21 17:01:18] [INFO ] Deduced a trap composed of 18 places in 4416 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 17:01:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 17:01:18] [INFO ] After 29016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 86 ms.
Support contains 88 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Graph (complete) has 1119 edges and 436 vertex of which 427 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.128 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 427 transition count 8688
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 45 rules applied. Total rules applied 107 place count 401 transition count 8669
Reduce places removed 4 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 15 rules applied. Total rules applied 122 place count 397 transition count 8658
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 136 place count 386 transition count 8655
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 136 place count 386 transition count 8594
Deduced a syphon composed of 61 places in 5 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 258 place count 325 transition count 8594
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 310 place count 273 transition count 8542
Iterating global reduction 4 with 52 rules applied. Total rules applied 362 place count 273 transition count 8542
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 367 place count 273 transition count 8537
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 395 place count 245 transition count 8506
Iterating global reduction 5 with 28 rules applied. Total rules applied 423 place count 245 transition count 8506
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 430 place count 245 transition count 8499
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 433 place count 242 transition count 8496
Iterating global reduction 6 with 3 rules applied. Total rules applied 436 place count 242 transition count 8496
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 440 place count 242 transition count 8492
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 441 place count 241 transition count 8491
Iterating global reduction 7 with 1 rules applied. Total rules applied 442 place count 241 transition count 8491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 443 place count 241 transition count 8490
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 461 place count 232 transition count 8481
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 462 place count 232 transition count 8480
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 468 place count 226 transition count 8474
Iterating global reduction 9 with 6 rules applied. Total rules applied 474 place count 226 transition count 8474
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 477 place count 223 transition count 8471
Iterating global reduction 9 with 3 rules applied. Total rules applied 480 place count 223 transition count 8471
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 482 place count 221 transition count 8469
Iterating global reduction 9 with 2 rules applied. Total rules applied 484 place count 221 transition count 8469
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 502 place count 221 transition count 8451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 508 place count 218 transition count 8448
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 511 place count 215 transition count 8445
Iterating global reduction 9 with 3 rules applied. Total rules applied 514 place count 215 transition count 8445
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 517 place count 215 transition count 8442
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 536 place count 215 transition count 8423
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 555 place count 196 transition count 8423
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 556 place count 196 transition count 8422
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 566 place count 196 transition count 8422
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 573 place count 196 transition count 8415
Applied a total of 573 rules in 85860 ms. Remains 196 /436 variables (removed 240) and now considering 8415/8758 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85868 ms. Remains : 196/436 places, 8415/8758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19581 ms. (steps per millisecond=0 ) properties (out of 6) seen :1
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 8415 rows 196 cols
[2023-03-21 17:03:04] [INFO ] Computed 11 place invariants in 56 ms
[2023-03-21 17:03:04] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 17:03:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-21 17:03:08] [INFO ] After 3746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 17:03:09] [INFO ] State equation strengthened by 8304 read => feed constraints.
[2023-03-21 17:03:14] [INFO ] After 4113ms SMT Verify possible using 8304 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 17:03:19] [INFO ] Deduced a trap composed of 11 places in 5033 ms of which 2 ms to minimize.
[2023-03-21 17:03:24] [INFO ] Deduced a trap composed of 6 places in 5107 ms of which 2 ms to minimize.
[2023-03-21 17:03:29] [INFO ] Deduced a trap composed of 10 places in 4123 ms of which 1 ms to minimize.
[2023-03-21 17:03:36] [INFO ] Deduced a trap composed of 7 places in 7356 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 17:03:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 17:03:36] [INFO ] After 32384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 79 ms.
Support contains 68 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 8415/8415 transitions.
Graph (complete) has 764 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.39 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 195 transition count 8411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 194 transition count 8411
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 194 transition count 8407
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 190 transition count 8407
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 21 place count 183 transition count 8400
Iterating global reduction 2 with 7 rules applied. Total rules applied 28 place count 183 transition count 8400
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 179 transition count 8396
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 179 transition count 8396
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 45 place count 179 transition count 8387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 178 transition count 8386
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 178 transition count 8386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 178 transition count 8385
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 4 with 14 rules applied. Total rules applied 62 place count 171 transition count 8378
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 69 place count 164 transition count 8371
Iterating global reduction 4 with 7 rules applied. Total rules applied 76 place count 164 transition count 8371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 79 place count 164 transition count 8368
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 80 place count 163 transition count 8367
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 163 transition count 8367
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 82 place count 162 transition count 8366
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 162 transition count 8366
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 162 transition count 8364
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 162 transition count 8362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 89 place count 160 transition count 8362
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 95 place count 160 transition count 8362
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 100 place count 160 transition count 8357
Applied a total of 100 rules in 56189 ms. Remains 160 /196 variables (removed 36) and now considering 8357/8415 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56189 ms. Remains : 160/196 places, 8357/8415 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21962 ms. (steps per millisecond=0 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 3111191 steps, run timeout after 66001 ms. (steps per millisecond=47 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 3111191 steps, saw 401650 distinct states, run finished after 66003 ms. (steps per millisecond=47 ) properties seen :4
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 8357 rows 160 cols
[2023-03-21 17:06:01] [INFO ] Computed 13 place invariants in 40 ms
[2023-03-21 17:06:01] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 17:06:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-21 17:06:04] [INFO ] After 3149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 17:06:06] [INFO ] State equation strengthened by 8274 read => feed constraints.
[2023-03-21 17:06:08] [INFO ] After 2135ms SMT Verify possible using 8274 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 17:06:15] [INFO ] Deduced a trap composed of 7 places in 6103 ms of which 3 ms to minimize.
[2023-03-21 17:06:24] [INFO ] Deduced a trap composed of 2 places in 8902 ms of which 1 ms to minimize.
[2023-03-21 17:06:30] [INFO ] Deduced a trap composed of 8 places in 5873 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 17:06:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 17:06:30] [INFO ] After 28852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 11 ms.
Support contains 35 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 8357/8357 transitions.
Graph (complete) has 676 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 158 transition count 8348
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 151 transition count 8348
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 17 place count 151 transition count 8341
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 31 place count 144 transition count 8341
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 134 transition count 8331
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 134 transition count 8331
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 98 place count 134 transition count 8284
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 106 place count 130 transition count 8280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 130 transition count 8279
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 126 transition count 8275
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 126 transition count 8275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 126 transition count 8273
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 125 transition count 8272
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 125 transition count 8272
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 125 place count 125 transition count 8266
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 125 transition count 8265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 124 transition count 8265
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 129 place count 124 transition count 8265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 130 place count 124 transition count 8264
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 131 place count 124 transition count 8263
Applied a total of 131 rules in 55354 ms. Remains 124 /160 variables (removed 36) and now considering 8263/8357 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55354 ms. Remains : 124/160 places, 8263/8357 transitions.
[2023-03-21 17:07:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-21 17:07:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 8263 transitions and 195602 arcs took 137 ms.
[2023-03-21 17:07:28] [INFO ] Flatten gal took : 1481 ms
Total runtime 441088 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 11a
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 124 places, 8263 transitions, 195602 arcs.
Final Score: 40714.55
Took : 1490 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-11a-ReachabilityCardinality-04 (reachable & potential(( ( ( ( ( (tk(P73)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P73)) ) ) & ( ( (tk(P11)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P11)) ) ) ) & ( ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) & ( ( ( (tk(P92)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P92)) ) ) & ( ( (tk(P9)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P9)) ) ) ) ) ) & ( ( ( ( ( (tk(P38)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P38)) ) ) | ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) ) & ( ( ( (tk(P88)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P88)) ) ) | ( ( ( ( (tk(P82)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P82)) ) ) & ( ( (tk(P101)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P101)) ) ) ) | ( ( ( (tk(P65)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P65)) ) ) & ( ( (tk(P105)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P105)) ) ) ) ) ) ) & ( ( ( ( (tk(P21)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P21)) ) ) | ( ( (tk(P120)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P120)) ) ) ) & ( ( ( ( ( (tk(P66)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P66)) ) ) | ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) | ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) ) ) | ( ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) | ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) ) | ( ( ( (tk(P61)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P61)) ) ) | ( ( (tk(P100)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P100)) ) ) ) ) ) & ( ( ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) & ( ( ( ( (tk(P28)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P28)) ) ) | ( ( ( (tk(P76)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P76)) ) ) & ( ( (tk(P80)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P80)) ) ) ) ) & ( ( ( ( (tk(P113)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P113)) ) ) | ( ( (tk(P45)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P45)) ) ) ) | ( ( ( (tk(P42)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P42)) ) ) | ( ( (tk(P117)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P117)) ) ) ) ) ) ) | ( ( ( (tk(P93)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P93)) ) ) & ( ( ( ( (tk(P15)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P15)) ) ) | ( ( ( (tk(P101)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P101)) ) ) | ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P34)) ) ) ) ) | ( ( ( (tk(P56)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P56)) ) ) | ( ( ( (tk(P13)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P13)) ) ) | ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) ) ) ) ) ) ) ) ) )))

BK_STOP 1679421393244

--------------------
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
terminate called after throwing an instance of 'sv_encoder::error'
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 657 Aborted ${SMART}/smart ${INPUT_SM}

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-11a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyCommit-PT-11a, 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 r459-smll-167912651400542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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