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-167912651600702.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 StigmergyElection-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-167912651600702
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 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 153M 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 StigmergyElection-PT-11a-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-11a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679488378943

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=StigmergyElection-PT-11a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 12:33:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 12:33:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:33:09] [INFO ] Load time of PNML (sax parser for PT used): 7407 ms
[2023-03-22 12:33:09] [INFO ] Transformed 156 places.
[2023-03-22 12:33:10] [INFO ] Transformed 136650 transitions.
[2023-03-22 12:33:10] [INFO ] Found NUPN structural information;
[2023-03-22 12:33:10] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 8388 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 StigmergyElection-PT-11a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3868 ms. (steps per millisecond=2 ) properties (out of 13) seen :5
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :1
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 12:33:15] [INFO ] Flow matrix only has 4272 transitions (discarded 33 similar events)
// Phase 1: matrix 4272 rows 156 cols
[2023-03-22 12:33:15] [INFO ] Computed 12 place invariants in 83 ms
[2023-03-22 12:33:16] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 12:33:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-22 12:33:19] [INFO ] After 2311ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-22 12:33:20] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2023-03-22 12:33:21] [INFO ] After 1448ms SMT Verify possible using 4148 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-22 12:33:24] [INFO ] Deduced a trap composed of 12 places in 2602 ms of which 26 ms to minimize.
[2023-03-22 12:33:26] [INFO ] Deduced a trap composed of 14 places in 2264 ms of which 2 ms to minimize.
[2023-03-22 12:33:28] [INFO ] Deduced a trap composed of 13 places in 1555 ms of which 2 ms to minimize.
[2023-03-22 12:33:29] [INFO ] Deduced a trap composed of 12 places in 1439 ms of which 2 ms to minimize.
[2023-03-22 12:33:31] [INFO ] Deduced a trap composed of 12 places in 1130 ms of which 2 ms to minimize.
[2023-03-22 12:33:32] [INFO ] Deduced a trap composed of 13 places in 1165 ms of which 2 ms to minimize.
[2023-03-22 12:33:33] [INFO ] Deduced a trap composed of 12 places in 935 ms of which 2 ms to minimize.
[2023-03-22 12:33:34] [INFO ] Deduced a trap composed of 12 places in 747 ms of which 1 ms to minimize.
[2023-03-22 12:33:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 12982 ms
[2023-03-22 12:33:35] [INFO ] Deduced a trap composed of 13 places in 1275 ms of which 1 ms to minimize.
[2023-03-22 12:33:37] [INFO ] Deduced a trap composed of 12 places in 1352 ms of which 1 ms to minimize.
[2023-03-22 12:33:38] [INFO ] Deduced a trap composed of 13 places in 1113 ms of which 1 ms to minimize.
[2023-03-22 12:33:39] [INFO ] Deduced a trap composed of 12 places in 589 ms of which 0 ms to minimize.
[2023-03-22 12:33:40] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 1 ms to minimize.
[2023-03-22 12:33:40] [INFO ] Deduced a trap composed of 12 places in 476 ms of which 3 ms to minimize.
[2023-03-22 12:33:41] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 1 ms to minimize.
[2023-03-22 12:33:44] [INFO ] Deduced a trap composed of 14 places in 2580 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 12:33:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 12:33:44] [INFO ] After 27643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 47 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Graph (complete) has 584 edges and 156 vertex of which 148 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.55 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 148 transition count 4257
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 23 rules applied. Total rules applied 64 place count 138 transition count 4244
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 69 place count 135 transition count 4242
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 72 place count 133 transition count 4241
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 72 place count 133 transition count 4231
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 92 place count 123 transition count 4231
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 103 place count 112 transition count 4220
Iterating global reduction 4 with 11 rules applied. Total rules applied 114 place count 112 transition count 4220
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 117 place count 109 transition count 4216
Iterating global reduction 4 with 3 rules applied. Total rules applied 120 place count 109 transition count 4216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 109 transition count 4215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 108 transition count 4214
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 108 transition count 4214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 108 transition count 4213
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 140 place count 100 transition count 4205
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 145 place count 95 transition count 4200
Iterating global reduction 6 with 5 rules applied. Total rules applied 150 place count 95 transition count 4200
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 161 place count 95 transition count 4189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 161 place count 95 transition count 4188
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 94 transition count 4188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 167 place count 92 transition count 4186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 91 transition count 4185
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 91 transition count 4185
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 170 place count 91 transition count 4184
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 91 transition count 4184
Applied a total of 171 rules in 12343 ms. Remains 91 /156 variables (removed 65) and now considering 4184/4305 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12347 ms. Remains : 91/156 places, 4184/4305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4700 ms. (steps per millisecond=2 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 963777 steps, run timeout after 12001 ms. (steps per millisecond=80 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 963777 steps, saw 132020 distinct states, run finished after 12002 ms. (steps per millisecond=80 ) properties seen :2
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 4184 rows 91 cols
[2023-03-22 12:34:13] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-22 12:34:13] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:34:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 12:34:14] [INFO ] After 1141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:34:15] [INFO ] State equation strengthened by 4135 read => feed constraints.
[2023-03-22 12:34:16] [INFO ] After 921ms SMT Verify possible using 4135 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:34:18] [INFO ] Deduced a trap composed of 6 places in 1843 ms of which 1 ms to minimize.
[2023-03-22 12:34:19] [INFO ] Deduced a trap composed of 6 places in 1505 ms of which 0 ms to minimize.
[2023-03-22 12:34:21] [INFO ] Deduced a trap composed of 6 places in 1225 ms of which 1 ms to minimize.
[2023-03-22 12:34:23] [INFO ] Deduced a trap composed of 9 places in 2072 ms of which 1 ms to minimize.
[2023-03-22 12:34:25] [INFO ] Deduced a trap composed of 7 places in 1388 ms of which 0 ms to minimize.
[2023-03-22 12:34:26] [INFO ] Deduced a trap composed of 12 places in 1110 ms of which 1 ms to minimize.
[2023-03-22 12:34:27] [INFO ] Deduced a trap composed of 12 places in 1077 ms of which 1 ms to minimize.
[2023-03-22 12:34:28] [INFO ] Deduced a trap composed of 7 places in 1231 ms of which 2 ms to minimize.
[2023-03-22 12:34:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 12497 ms
[2023-03-22 12:34:28] [INFO ] After 13482ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-22 12:34:28] [INFO ] After 15260ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA StigmergyElection-PT-11a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 87018 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyElection (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: 156 places, 136650 transitions, 3001363 arcs.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11712116 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15936384 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

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="StigmergyElection-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 StigmergyElection-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-167912651600702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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