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

About the Execution of Smart+red for MultiCrashLeafsetExtension-PT-S16C02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
891.243 237287.00 301985.00 818.10 T 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.r249-tall-167856436200468.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 MultiCrashLeafsetExtension-PT-S16C02, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r249-tall-167856436200468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 12K Feb 26 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678737599622

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C02
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:00:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 20:00:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:00:01] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-13 20:00:01] [INFO ] Transformed 2952 places.
[2023-03-13 20:00:02] [INFO ] Transformed 4255 transitions.
[2023-03-13 20:00:02] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 287 ms.
Incomplete random walk after 10000 steps, including 468 resets, run finished after 1397 ms. (steps per millisecond=7 ) properties (out of 2952) seen :1981
Running SMT prover for 971 properties.
[2023-03-13 20:00:03] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-13 20:00:03] [INFO ] Computed 421 place invariants in 178 ms
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-13 20:00:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:00:29] [INFO ] After 25068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 971 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 971 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.17 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 410 transitions
Trivial Post-agglo rules discarded 410 transitions
Performed 410 trivial Post agglomeration. Transition count delta: 410
Iterating post reduction 0 with 410 rules applied. Total rules applied 411 place count 2928 transition count 3845
Reduce places removed 410 places and 0 transitions.
Iterating post reduction 1 with 410 rules applied. Total rules applied 821 place count 2518 transition count 3845
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 821 place count 2518 transition count 3777
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 957 place count 2450 transition count 3777
Discarding 342 places :
Symmetric choice reduction at 2 with 342 rule applications. Total rules 1299 place count 2108 transition count 3435
Iterating global reduction 2 with 342 rules applied. Total rules applied 1641 place count 2108 transition count 3435
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 1752 place count 1997 transition count 3213
Iterating global reduction 2 with 111 rules applied. Total rules applied 1863 place count 1997 transition count 3213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1867 place count 1995 transition count 3211
Free-agglomeration rule (complex) applied 171 times.
Iterating global reduction 2 with 171 rules applied. Total rules applied 2038 place count 1995 transition count 3151
Reduce places removed 171 places and 0 transitions.
Iterating post reduction 2 with 171 rules applied. Total rules applied 2209 place count 1824 transition count 3151
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 3 with 68 rules applied. Total rules applied 2277 place count 1824 transition count 3151
Applied a total of 2277 rules in 793 ms. Remains 1824 /2952 variables (removed 1128) and now considering 3151/4255 (removed 1104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 1824/2952 places, 3151/4255 transitions.
Interrupted random walk after 448420 steps, including 32533 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 325
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Running SMT prover for 646 properties.
[2023-03-13 20:01:00] [INFO ] Flow matrix only has 2862 transitions (discarded 289 similar events)
// Phase 1: matrix 2862 rows 1824 cols
[2023-03-13 20:01:00] [INFO ] Computed 397 place invariants in 69 ms
[2023-03-13 20:01:21] [INFO ] After 20905ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:646
[2023-03-13 20:01:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 52 ms returned sat
[2023-03-13 20:01:39] [INFO ] [Nat]Absence check using 33 positive and 364 generalized place invariants in 75 ms returned sat
[2023-03-13 20:02:47] [INFO ] After 49799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :646
[2023-03-13 20:02:47] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2023-03-13 20:03:01] [INFO ] After 14510ms SMT Verify possible using 1090 Read/Feed constraints in natural domain returned unsat :590 sat :56
[2023-03-13 20:03:02] [INFO ] Deduced a trap composed of 313 places in 1061 ms of which 9 ms to minimize.
[2023-03-13 20:03:04] [INFO ] Deduced a trap composed of 320 places in 1136 ms of which 2 ms to minimize.
[2023-03-13 20:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2458 ms
[2023-03-13 20:03:06] [INFO ] Deduced a trap composed of 207 places in 1050 ms of which 3 ms to minimize.
[2023-03-13 20:03:07] [INFO ] Deduced a trap composed of 311 places in 976 ms of which 5 ms to minimize.
[2023-03-13 20:03:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2284 ms
[2023-03-13 20:03:08] [INFO ] Deduced a trap composed of 198 places in 1046 ms of which 3 ms to minimize.
[2023-03-13 20:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1214 ms
[2023-03-13 20:03:11] [INFO ] Deduced a trap composed of 230 places in 1069 ms of which 1 ms to minimize.
[2023-03-13 20:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1238 ms
[2023-03-13 20:03:13] [INFO ] Deduced a trap composed of 198 places in 1077 ms of which 1 ms to minimize.
[2023-03-13 20:03:14] [INFO ] Deduced a trap composed of 367 places in 993 ms of which 1 ms to minimize.
[2023-03-13 20:03:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2326 ms
[2023-03-13 20:03:16] [INFO ] Deduced a trap composed of 255 places in 1072 ms of which 1 ms to minimize.
[2023-03-13 20:03:17] [INFO ] Deduced a trap composed of 382 places in 971 ms of which 1 ms to minimize.
[2023-03-13 20:03:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2292 ms
[2023-03-13 20:03:19] [INFO ] Deduced a trap composed of 197 places in 1070 ms of which 2 ms to minimize.
[2023-03-13 20:03:20] [INFO ] Deduced a trap composed of 475 places in 975 ms of which 1 ms to minimize.
[2023-03-13 20:03:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2301 ms
[2023-03-13 20:03:21] [INFO ] Deduced a trap composed of 442 places in 1013 ms of which 2 ms to minimize.
[2023-03-13 20:03:23] [INFO ] Deduced a trap composed of 236 places in 1082 ms of which 2 ms to minimize.
[2023-03-13 20:03:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2372 ms
[2023-03-13 20:03:24] [INFO ] Deduced a trap composed of 199 places in 1061 ms of which 2 ms to minimize.
[2023-03-13 20:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1221 ms
[2023-03-13 20:03:26] [INFO ] Deduced a trap composed of 190 places in 1039 ms of which 2 ms to minimize.
[2023-03-13 20:03:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1210 ms
[2023-03-13 20:03:27] [INFO ] Deduced a trap composed of 190 places in 1046 ms of which 2 ms to minimize.
[2023-03-13 20:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1212 ms
[2023-03-13 20:03:29] [INFO ] Deduced a trap composed of 198 places in 1092 ms of which 1 ms to minimize.
[2023-03-13 20:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1269 ms
[2023-03-13 20:03:31] [INFO ] Deduced a trap composed of 370 places in 1112 ms of which 3 ms to minimize.
[2023-03-13 20:03:32] [INFO ] Deduced a trap composed of 203 places in 1056 ms of which 2 ms to minimize.
[2023-03-13 20:03:33] [INFO ] Deduced a trap composed of 206 places in 1057 ms of which 2 ms to minimize.
[2023-03-13 20:03:34] [INFO ] Deduced a trap composed of 217 places in 1072 ms of which 2 ms to minimize.
[2023-03-13 20:03:35] [INFO ] Deduced a trap composed of 195 places in 1063 ms of which 2 ms to minimize.
[2023-03-13 20:03:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5897 ms
[2023-03-13 20:03:37] [INFO ] Deduced a trap composed of 200 places in 1083 ms of which 2 ms to minimize.
[2023-03-13 20:03:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1264 ms
[2023-03-13 20:03:39] [INFO ] Deduced a trap composed of 231 places in 1109 ms of which 2 ms to minimize.
[2023-03-13 20:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1284 ms
[2023-03-13 20:03:41] [INFO ] Deduced a trap composed of 199 places in 1077 ms of which 1 ms to minimize.
[2023-03-13 20:03:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1247 ms
[2023-03-13 20:03:42] [INFO ] Deduced a trap composed of 227 places in 1114 ms of which 1 ms to minimize.
[2023-03-13 20:03:44] [INFO ] Deduced a trap composed of 208 places in 1116 ms of which 2 ms to minimize.
[2023-03-13 20:03:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2493 ms
[2023-03-13 20:03:45] [INFO ] Deduced a trap composed of 185 places in 1120 ms of which 1 ms to minimize.
[2023-03-13 20:03:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1294 ms
[2023-03-13 20:03:46] [INFO ] After 58923ms SMT Verify possible using trap constraints in natural domain returned unsat :590 sat :56
Attempting to minimize the solution found.
Minimization took 9782 ms.
[2023-03-13 20:03:55] [INFO ] After 154004ms SMT Verify possible using all constraints in natural domain returned unsat :590 sat :56
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 234261 ms.
ITS solved all properties within timeout

BK_STOP 1678737836909

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -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="MultiCrashLeafsetExtension-PT-S16C02"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 MultiCrashLeafsetExtension-PT-S16C02, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r249-tall-167856436200468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C02.tgz
mv MultiCrashLeafsetExtension-PT-S16C02 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;