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-167903718800478.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 ShieldPPPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718800478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 528K 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 ShieldPPPs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679569239655

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=ShieldPPPs-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 11:00:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 11:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:00:43] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-23 11:00:43] [INFO ] Transformed 2043 places.
[2023-03-23 11:00:43] [INFO ] Transformed 1893 transitions.
[2023-03-23 11:00:43] [INFO ] Found NUPN structural information;
[2023-03-23 11:00:43] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 12) seen :9
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-23 11:00:44] [INFO ] Computed 331 place invariants in 68 ms
[2023-03-23 11:00:45] [INFO ] After 1020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:00:46] [INFO ] [Nat]Absence check using 331 positive place invariants in 199 ms returned sat
[2023-03-23 11:00:49] [INFO ] After 3087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:00:51] [INFO ] Deduced a trap composed of 23 places in 1306 ms of which 21 ms to minimize.
[2023-03-23 11:00:52] [INFO ] Deduced a trap composed of 19 places in 796 ms of which 2 ms to minimize.
[2023-03-23 11:00:52] [INFO ] Deduced a trap composed of 20 places in 538 ms of which 1 ms to minimize.
[2023-03-23 11:00:53] [INFO ] Deduced a trap composed of 22 places in 524 ms of which 3 ms to minimize.
[2023-03-23 11:00:54] [INFO ] Deduced a trap composed of 20 places in 938 ms of which 4 ms to minimize.
[2023-03-23 11:00:55] [INFO ] Deduced a trap composed of 30 places in 907 ms of which 16 ms to minimize.
[2023-03-23 11:00:56] [INFO ] Deduced a trap composed of 16 places in 672 ms of which 1 ms to minimize.
[2023-03-23 11:00:56] [INFO ] Deduced a trap composed of 18 places in 778 ms of which 2 ms to minimize.
[2023-03-23 11:00:57] [INFO ] Deduced a trap composed of 15 places in 466 ms of which 1 ms to minimize.
[2023-03-23 11:00:58] [INFO ] Deduced a trap composed of 24 places in 565 ms of which 2 ms to minimize.
[2023-03-23 11:00:58] [INFO ] Deduced a trap composed of 32 places in 518 ms of which 2 ms to minimize.
[2023-03-23 11:00:59] [INFO ] Deduced a trap composed of 28 places in 477 ms of which 1 ms to minimize.
[2023-03-23 11:01:00] [INFO ] Deduced a trap composed of 43 places in 988 ms of which 1 ms to minimize.
[2023-03-23 11:01:01] [INFO ] Deduced a trap composed of 31 places in 517 ms of which 1 ms to minimize.
[2023-03-23 11:01:01] [INFO ] Deduced a trap composed of 46 places in 600 ms of which 2 ms to minimize.
[2023-03-23 11:01:02] [INFO ] Deduced a trap composed of 27 places in 418 ms of which 1 ms to minimize.
[2023-03-23 11:01:02] [INFO ] Deduced a trap composed of 28 places in 493 ms of which 2 ms to minimize.
[2023-03-23 11:01:03] [INFO ] Deduced a trap composed of 42 places in 528 ms of which 1 ms to minimize.
[2023-03-23 11:01:04] [INFO ] Deduced a trap composed of 39 places in 580 ms of which 1 ms to minimize.
[2023-03-23 11:01:05] [INFO ] Deduced a trap composed of 36 places in 636 ms of which 1 ms to minimize.
[2023-03-23 11:01:05] [INFO ] Deduced a trap composed of 18 places in 598 ms of which 1 ms to minimize.
[2023-03-23 11:01:06] [INFO ] Deduced a trap composed of 36 places in 522 ms of which 1 ms to minimize.
[2023-03-23 11:01:06] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 0 ms to minimize.
[2023-03-23 11:01:07] [INFO ] Deduced a trap composed of 29 places in 416 ms of which 1 ms to minimize.
[2023-03-23 11:01:08] [INFO ] Deduced a trap composed of 22 places in 598 ms of which 3 ms to minimize.
[2023-03-23 11:01:08] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 1 ms to minimize.
[2023-03-23 11:01:09] [INFO ] Deduced a trap composed of 42 places in 435 ms of which 2 ms to minimize.
[2023-03-23 11:01:09] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 1 ms to minimize.
[2023-03-23 11:01:10] [INFO ] Deduced a trap composed of 28 places in 408 ms of which 11 ms to minimize.
[2023-03-23 11:01:11] [INFO ] Deduced a trap composed of 32 places in 856 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-23 11:01:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:01:11] [INFO ] After 25511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 181 ms.
Support contains 71 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 2043 transition count 1706
Reduce places removed 187 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 195 rules applied. Total rules applied 382 place count 1856 transition count 1698
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 390 place count 1848 transition count 1698
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 390 place count 1848 transition count 1549
Deduced a syphon composed of 149 places in 6 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 688 place count 1699 transition count 1549
Discarding 193 places :
Symmetric choice reduction at 3 with 193 rule applications. Total rules 881 place count 1506 transition count 1356
Iterating global reduction 3 with 193 rules applied. Total rules applied 1074 place count 1506 transition count 1356
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1074 place count 1506 transition count 1282
Deduced a syphon composed of 74 places in 3 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 1222 place count 1432 transition count 1282
Performed 422 Post agglomeration using F-continuation condition.Transition count delta: 422
Deduced a syphon composed of 422 places in 11 ms
Reduce places removed 422 places and 0 transitions.
Iterating global reduction 3 with 844 rules applied. Total rules applied 2066 place count 1010 transition count 860
Partial Free-agglomeration rule applied 245 times.
Drop transitions removed 245 transitions
Iterating global reduction 3 with 245 rules applied. Total rules applied 2311 place count 1010 transition count 860
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2312 place count 1009 transition count 859
Applied a total of 2312 rules in 872 ms. Remains 1009 /2043 variables (removed 1034) and now considering 859/1893 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 1009/2043 places, 859/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :2
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 859 rows 1009 cols
[2023-03-23 11:01:12] [INFO ] Computed 331 place invariants in 55 ms
[2023-03-23 11:01:12] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:01:13] [INFO ] [Nat]Absence check using 309 positive place invariants in 98 ms returned sat
[2023-03-23 11:01:13] [INFO ] [Nat]Absence check using 309 positive and 22 generalized place invariants in 9 ms returned sat
[2023-03-23 11:01:13] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:01:14] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-23 11:01:14] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 0 ms to minimize.
[2023-03-23 11:01:14] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-23 11:01:15] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 17 ms to minimize.
[2023-03-23 11:01:15] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-23 11:01:15] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 0 ms to minimize.
[2023-03-23 11:01:16] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 1 ms to minimize.
[2023-03-23 11:01:16] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 1 ms to minimize.
[2023-03-23 11:01:17] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-23 11:01:17] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 15 ms to minimize.
[2023-03-23 11:01:17] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2023-03-23 11:01:17] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-23 11:01:18] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-23 11:01:18] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 ms to minimize.
[2023-03-23 11:01:18] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 0 ms to minimize.
[2023-03-23 11:01:19] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2023-03-23 11:01:19] [INFO ] Deduced a trap composed of 18 places in 399 ms of which 1 ms to minimize.
[2023-03-23 11:01:19] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 0 ms to minimize.
[2023-03-23 11:01:20] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 0 ms to minimize.
[2023-03-23 11:01:20] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2023-03-23 11:01:20] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 1 ms to minimize.
[2023-03-23 11:01:21] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-23 11:01:21] [INFO ] Deduced a trap composed of 12 places in 452 ms of which 0 ms to minimize.
[2023-03-23 11:01:21] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 0 ms to minimize.
[2023-03-23 11:01:22] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2023-03-23 11:01:22] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 14 ms to minimize.
[2023-03-23 11:01:22] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 20 ms to minimize.
[2023-03-23 11:01:23] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 0 ms to minimize.
[2023-03-23 11:01:23] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2023-03-23 11:01:23] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-23 11:01:23] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-03-23 11:01:24] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2023-03-23 11:01:24] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-23 11:01:24] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-23 11:01:25] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2023-03-23 11:01:25] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 11118 ms
[2023-03-23 11:01:25] [INFO ] After 12138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 375 ms.
[2023-03-23 11:01:25] [INFO ] After 12864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 25 out of 1009 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 859/859 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1009 transition count 850
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1000 transition count 850
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 18 place count 1000 transition count 842
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 992 transition count 842
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 86 place count 966 transition count 816
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 966 transition count 816
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 959 transition count 809
Applied a total of 97 rules in 328 ms. Remains 959 /1009 variables (removed 50) and now considering 809/859 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 959/1009 places, 809/859 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 184762 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184762 steps, saw 133792 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 809 rows 959 cols
[2023-03-23 11:01:29] [INFO ] Computed 331 place invariants in 38 ms
[2023-03-23 11:01:29] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:01:29] [INFO ] [Nat]Absence check using 310 positive place invariants in 63 ms returned sat
[2023-03-23 11:01:29] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-23 11:01:30] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:01:31] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-23 11:01:31] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 0 ms to minimize.
[2023-03-23 11:01:31] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 29 ms to minimize.
[2023-03-23 11:01:32] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-23 11:01:32] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2023-03-23 11:01:32] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2023-03-23 11:01:33] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-23 11:01:33] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-23 11:01:33] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 0 ms to minimize.
[2023-03-23 11:01:33] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6843 ms
[2023-03-23 11:01:37] [INFO ] After 8275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-23 11:01:38] [INFO ] After 8727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 25 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 809/809 transitions.
Applied a total of 0 rules in 51 ms. Remains 959 /959 variables (removed 0) and now considering 809/809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 959/959 places, 809/809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 809/809 transitions.
Applied a total of 0 rules in 29 ms. Remains 959 /959 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2023-03-23 11:01:38] [INFO ] Invariant cache hit.
[2023-03-23 11:01:39] [INFO ] Implicit Places using invariants in 892 ms returned []
[2023-03-23 11:01:39] [INFO ] Invariant cache hit.
[2023-03-23 11:01:40] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2535 ms to find 0 implicit places.
[2023-03-23 11:01:40] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-23 11:01:40] [INFO ] Invariant cache hit.
[2023-03-23 11:01:41] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3127 ms. Remains : 959/959 places, 809/809 transitions.
Applied a total of 0 rules in 41 ms. Remains 959 /959 variables (removed 0) and now considering 809/809 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-23 11:01:41] [INFO ] Invariant cache hit.
[2023-03-23 11:01:41] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:01:41] [INFO ] [Nat]Absence check using 310 positive place invariants in 86 ms returned sat
[2023-03-23 11:01:41] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-23 11:01:42] [INFO ] After 692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:01:43] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2023-03-23 11:01:43] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-23 11:01:43] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-23 11:01:43] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-23 11:01:44] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2023-03-23 11:01:44] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2023-03-23 11:01:45] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 0 ms to minimize.
[2023-03-23 11:01:45] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 1 ms to minimize.
[2023-03-23 11:01:45] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2023-03-23 11:01:45] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 0 ms to minimize.
[2023-03-23 11:01:46] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2023-03-23 11:01:46] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-23 11:01:46] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-23 11:01:47] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-23 11:01:47] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2023-03-23 11:01:47] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-23 11:01:47] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2023-03-23 11:01:48] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-23 11:01:48] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-23 11:01:48] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 1 ms to minimize.
[2023-03-23 11:01:48] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 2 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 8198 ms
[2023-03-23 11:01:50] [INFO ] After 9110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-23 11:01:51] [INFO ] After 9723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:01:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 23 ms.
[2023-03-23 11:01:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 959 places, 809 transitions and 3590 arcs took 10 ms.
[2023-03-23 11:01:51] [INFO ] Flatten gal took : 140 ms
Total runtime 68335 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (PT), instance 030B
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: 959 places, 809 transitions, 3590 arcs.
Final Score: 26895.923
Took : 38 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPs-PT-030B-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( (tk(P940)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P940)) ) ) & ( ( (tk(P411)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P411)) ) ) ) & ( ( ( (tk(P955)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P955)) ) ) & ( ( (tk(P27)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P27)) ) ) ) ) & ( ( ( ( ( (tk(P97)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P97)) ) ) | ( ( (tk(P864)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P864)) ) ) ) & ( ( ( ( (tk(P731)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P731)) ) ) | ( ( ( (tk(P33)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P33)) ) ) | ( ( (tk(P682)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P682)) ) ) ) ) | ( ( ( ( (tk(P382)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P382)) ) ) | ( ( (tk(P637)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P637)) ) ) ) | ( ( ( (tk(P916)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P916)) ) ) | ( ( ( (tk(P866)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P866)) ) ) & ( ( ( (tk(P165)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P165)) ) ) & ( ( (tk(P454)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P454)) ) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) & ( ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) ) | ( ( (tk(P854)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P854)) ) ) ) ) | ( ( ( (tk(P225)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P225)) ) ) & ( ( ( (tk(P355)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P355)) ) ) & ( ( (tk(P314)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P314)) ) ) ) ) ) & ( ( ( (tk(P101)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P101)) ) ) | ( ( ( (tk(P401)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P401)) ) ) | ( ( ( (tk(P792)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P792)) ) ) & ( ( (tk(P77)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P77)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3811372 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102704 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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-167903718800478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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