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.r395-oct2-167903718400110.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K 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 ShieldIIPs-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679553713926

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=ShieldIIPs-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 06:41:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 06:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:41:56] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-23 06:41:56] [INFO ] Transformed 1203 places.
[2023-03-23 06:41:56] [INFO ] Transformed 1183 transitions.
[2023-03-23 06:41:56] [INFO ] Found NUPN structural information;
[2023-03-23 06:41:56] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 15) seen :11
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2023-03-23 06:41:56] [INFO ] Computed 181 place invariants in 17 ms
[2023-03-23 06:41:57] [INFO ] After 574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 06:41:57] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2023-03-23 06:41:58] [INFO ] After 843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 06:41:59] [INFO ] Deduced a trap composed of 30 places in 612 ms of which 6 ms to minimize.
[2023-03-23 06:41:59] [INFO ] Deduced a trap composed of 22 places in 482 ms of which 2 ms to minimize.
[2023-03-23 06:42:00] [INFO ] Deduced a trap composed of 22 places in 726 ms of which 1 ms to minimize.
[2023-03-23 06:42:01] [INFO ] Deduced a trap composed of 26 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:42:01] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 1 ms to minimize.
[2023-03-23 06:42:02] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 1 ms to minimize.
[2023-03-23 06:42:02] [INFO ] Deduced a trap composed of 25 places in 379 ms of which 13 ms to minimize.
[2023-03-23 06:42:03] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 1 ms to minimize.
[2023-03-23 06:42:03] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 0 ms to minimize.
[2023-03-23 06:42:03] [INFO ] Deduced a trap composed of 19 places in 369 ms of which 0 ms to minimize.
[2023-03-23 06:42:04] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 1 ms to minimize.
[2023-03-23 06:42:04] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 1 ms to minimize.
[2023-03-23 06:42:04] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 1 ms to minimize.
[2023-03-23 06:42:05] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 1 ms to minimize.
[2023-03-23 06:42:05] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 1 ms to minimize.
[2023-03-23 06:42:06] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 1 ms to minimize.
[2023-03-23 06:42:06] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 2 ms to minimize.
[2023-03-23 06:42:07] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 1 ms to minimize.
[2023-03-23 06:42:07] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2023-03-23 06:42:07] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2023-03-23 06:42:08] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 1 ms to minimize.
[2023-03-23 06:42:08] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 18 ms to minimize.
[2023-03-23 06:42:08] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 1 ms to minimize.
[2023-03-23 06:42:09] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 1 ms to minimize.
[2023-03-23 06:42:09] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 14 ms to minimize.
[2023-03-23 06:42:09] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 0 ms to minimize.
[2023-03-23 06:42:10] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 1 ms to minimize.
[2023-03-23 06:42:10] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 1 ms to minimize.
[2023-03-23 06:42:11] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 0 ms to minimize.
[2023-03-23 06:42:11] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2023-03-23 06:42:11] [INFO ] Deduced a trap composed of 22 places in 344 ms of which 0 ms to minimize.
[2023-03-23 06:42:12] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 1 ms to minimize.
[2023-03-23 06:42:12] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2023-03-23 06:42:12] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 1 ms to minimize.
[2023-03-23 06:42:13] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 1 ms to minimize.
[2023-03-23 06:42:13] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 0 ms to minimize.
[2023-03-23 06:42:14] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 1 ms to minimize.
[2023-03-23 06:42:14] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 1 ms to minimize.
[2023-03-23 06:42:14] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 1 ms to minimize.
[2023-03-23 06:42:15] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 1 ms to minimize.
[2023-03-23 06:42:15] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 2 ms to minimize.
[2023-03-23 06:42:15] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 1 ms to minimize.
[2023-03-23 06:42:16] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 1 ms to minimize.
[2023-03-23 06:42:16] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2023-03-23 06:42:16] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 0 ms to minimize.
[2023-03-23 06:42:17] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 0 ms to minimize.
[2023-03-23 06:42:17] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 1 ms to minimize.
[2023-03-23 06:42:17] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 0 ms to minimize.
[2023-03-23 06:42:18] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 1 ms to minimize.
[2023-03-23 06:42:18] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2023-03-23 06:42:18] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2023-03-23 06:42:19] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 1 ms to minimize.
[2023-03-23 06:42:19] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 1 ms to minimize.
[2023-03-23 06:42:19] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 1 ms to minimize.
[2023-03-23 06:42:19] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 1 ms to minimize.
[2023-03-23 06:42:20] [INFO ] Deduced a trap composed of 40 places in 391 ms of which 13 ms to minimize.
[2023-03-23 06:42:20] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2023-03-23 06:42:20] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2023-03-23 06:42:21] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 0 ms to minimize.
[2023-03-23 06:42:21] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 22432 ms
[2023-03-23 06:42:22] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 0 ms to minimize.
[2023-03-23 06:42:22] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 1 ms to minimize.
[2023-03-23 06:42:22] [INFO ] Deduced a trap composed of 32 places in 374 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-23 06:42:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 06:42:22] [INFO ] After 25330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 145 ms.
Support contains 19 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1203 transition count 1086
Reduce places removed 97 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 99 rules applied. Total rules applied 196 place count 1106 transition count 1084
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 1104 transition count 1084
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 198 place count 1104 transition count 983
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 400 place count 1003 transition count 983
Discarding 133 places :
Symmetric choice reduction at 3 with 133 rule applications. Total rules 533 place count 870 transition count 850
Iterating global reduction 3 with 133 rules applied. Total rules applied 666 place count 870 transition count 850
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 666 place count 870 transition count 796
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 774 place count 816 transition count 796
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 1 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 1364 place count 521 transition count 501
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 3 with 137 rules applied. Total rules applied 1501 place count 521 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1502 place count 520 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1503 place count 519 transition count 500
Applied a total of 1503 rules in 285 ms. Remains 519 /1203 variables (removed 684) and now considering 500/1183 (removed 683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 519/1203 places, 500/1183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) 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
Interrupted probabilistic random walk after 198283 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{2=1}
Probabilistic random walk after 198283 steps, saw 156840 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 500 rows 519 cols
[2023-03-23 06:42:26] [INFO ] Computed 180 place invariants in 12 ms
[2023-03-23 06:42:26] [INFO ] [Real]Absence check using 178 positive place invariants in 51 ms returned sat
[2023-03-23 06:42:26] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 06:42:26] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:42:27] [INFO ] [Nat]Absence check using 178 positive place invariants in 57 ms returned sat
[2023-03-23 06:42:27] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 06:42:27] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:42:27] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-23 06:42:27] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-23 06:42:27] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-23 06:42:28] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-23 06:42:28] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-23 06:42:28] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2023-03-23 06:42:28] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-23 06:42:28] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 2 ms to minimize.
[2023-03-23 06:42:28] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-23 06:42:29] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 0 ms to minimize.
[2023-03-23 06:42:29] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-23 06:42:29] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-23 06:42:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2060 ms
[2023-03-23 06:42:29] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-23 06:42:29] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-23 06:42:29] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2023-03-23 06:42:30] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-23 06:42:30] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2023-03-23 06:42:30] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-23 06:42:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 891 ms
[2023-03-23 06:42:30] [INFO ] After 3351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-23 06:42:30] [INFO ] After 3727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 15 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 500/500 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 1 rules applied. Total rules applied 1 place count 519 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 518 transition count 499
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 515 transition count 496
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 515 transition count 496
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 514 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 514 transition count 495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 513 transition count 494
Applied a total of 12 rules in 104 ms. Remains 513 /519 variables (removed 6) and now considering 494/500 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 513/519 places, 494/500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 213924 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213924 steps, saw 162098 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 494 rows 513 cols
[2023-03-23 06:42:33] [INFO ] Computed 180 place invariants in 8 ms
[2023-03-23 06:42:34] [INFO ] [Real]Absence check using 178 positive place invariants in 83 ms returned sat
[2023-03-23 06:42:34] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 06:42:34] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:42:34] [INFO ] [Nat]Absence check using 178 positive place invariants in 62 ms returned sat
[2023-03-23 06:42:34] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 06:42:34] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:42:34] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2023-03-23 06:42:34] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-23 06:42:35] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-23 06:42:35] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-23 06:42:35] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-03-23 06:42:35] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-23 06:42:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 824 ms
[2023-03-23 06:42:35] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-03-23 06:42:35] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2023-03-23 06:42:35] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-23 06:42:36] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2023-03-23 06:42:36] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-23 06:42:36] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-23 06:42:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 838 ms
[2023-03-23 06:42:36] [INFO ] After 2045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-23 06:42:36] [INFO ] After 2296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 46 ms.
Support contains 15 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 494/494 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 513/513 places, 494/494 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 494/494 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 494/494 (removed 0) transitions.
[2023-03-23 06:42:36] [INFO ] Invariant cache hit.
[2023-03-23 06:42:36] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-23 06:42:36] [INFO ] Invariant cache hit.
[2023-03-23 06:42:37] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
[2023-03-23 06:42:37] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-23 06:42:37] [INFO ] Invariant cache hit.
[2023-03-23 06:42:37] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1482 ms. Remains : 513/513 places, 494/494 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 06:42:38] [INFO ] Invariant cache hit.
[2023-03-23 06:42:38] [INFO ] [Real]Absence check using 178 positive place invariants in 61 ms returned sat
[2023-03-23 06:42:38] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 06:42:38] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:42:38] [INFO ] [Nat]Absence check using 178 positive place invariants in 43 ms returned sat
[2023-03-23 06:42:38] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 06:42:38] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:42:38] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2023-03-23 06:42:39] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-23 06:42:39] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 0 ms to minimize.
[2023-03-23 06:42:39] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-23 06:42:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 833 ms
[2023-03-23 06:42:39] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-23 06:42:39] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-23 06:42:40] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-03-23 06:42:40] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-23 06:42:40] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2023-03-23 06:42:40] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2023-03-23 06:42:40] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-23 06:42:40] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-23 06:42:40] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-23 06:42:41] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-23 06:42:41] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-23 06:42:41] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-23 06:42:41] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2023-03-23 06:42:41] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-23 06:42:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2017 ms
[2023-03-23 06:42:41] [INFO ] After 3158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-23 06:42:41] [INFO ] After 3436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 06:42:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-23 06:42:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 513 places, 494 transitions and 2327 arcs took 10 ms.
[2023-03-23 06:42:42] [INFO ] Flatten gal took : 85 ms
Total runtime 46089 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 020B
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: 513 places, 494 transitions, 2327 arcs.
Final Score: 7015.502
Took : 22 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-020B-ReachabilityCardinality-12 (reachable & potential(( ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P95)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P95)) ) ) ) & ( ( ( (tk(P98)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P98)) ) ) & ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) ) )))
PROPERTY: ShieldIIPs-PT-020B-ReachabilityCardinality-13 (reachable & potential(( ( ( ( ( (tk(P461)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P461)) ) ) & ( ( (tk(P216)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P216)) ) ) ) & ( ( ( (tk(P264)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P264)) ) ) & ( ( (tk(P152)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P152)) ) ) ) ) & ( ( ( ( (tk(P358)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P358)) ) ) & ( ( (tk(P357)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P357)) ) ) ) & ( ( ( (tk(P406)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P406)) ) ) & ( ( ( (tk(P400)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P400)) ) ) & ( ( ( (tk(P508)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P508)) ) ) | ( ( ( (tk(P78)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P78)) ) ) | ( ( (tk(P163)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P163)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 8828684 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16104200 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
Caught signal 15, terminating.

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="ShieldIIPs-PT-020B"
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 ShieldIIPs-PT-020B, 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 r395-oct2-167903718400110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B 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 ;