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

About the Execution of Smart+red for ShieldRVs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11703.436 3600000.00 3657094.00 506.10 TFFFFFT?FT??TTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979300158.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979300158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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 ShieldRVs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679383087264

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=ShieldRVs-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:18:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 07:18:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:18:08] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-21 07:18:09] [INFO ] Transformed 2003 places.
[2023-03-21 07:18:09] [INFO ] Transformed 2253 transitions.
[2023-03-21 07:18:09] [INFO ] Found NUPN structural information;
[2023-03-21 07:18:09] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 14) seen :7
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-21 07:18:09] [INFO ] Computed 201 place invariants in 34 ms
[2023-03-21 07:18:10] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 07:18:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 72 ms returned sat
[2023-03-21 07:18:13] [INFO ] After 2702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 07:18:14] [INFO ] Deduced a trap composed of 25 places in 630 ms of which 8 ms to minimize.
[2023-03-21 07:18:15] [INFO ] Deduced a trap composed of 19 places in 584 ms of which 2 ms to minimize.
[2023-03-21 07:18:16] [INFO ] Deduced a trap composed of 27 places in 569 ms of which 2 ms to minimize.
[2023-03-21 07:18:16] [INFO ] Deduced a trap composed of 20 places in 580 ms of which 2 ms to minimize.
[2023-03-21 07:18:17] [INFO ] Deduced a trap composed of 22 places in 637 ms of which 1 ms to minimize.
[2023-03-21 07:18:18] [INFO ] Deduced a trap composed of 20 places in 681 ms of which 1 ms to minimize.
[2023-03-21 07:18:19] [INFO ] Deduced a trap composed of 33 places in 656 ms of which 1 ms to minimize.
[2023-03-21 07:18:19] [INFO ] Deduced a trap composed of 37 places in 667 ms of which 1 ms to minimize.
[2023-03-21 07:18:20] [INFO ] Deduced a trap composed of 27 places in 625 ms of which 1 ms to minimize.
[2023-03-21 07:18:21] [INFO ] Deduced a trap composed of 26 places in 585 ms of which 2 ms to minimize.
[2023-03-21 07:18:21] [INFO ] Deduced a trap composed of 24 places in 585 ms of which 2 ms to minimize.
[2023-03-21 07:18:22] [INFO ] Deduced a trap composed of 22 places in 614 ms of which 2 ms to minimize.
[2023-03-21 07:18:23] [INFO ] Deduced a trap composed of 23 places in 635 ms of which 1 ms to minimize.
[2023-03-21 07:18:24] [INFO ] Deduced a trap composed of 26 places in 619 ms of which 1 ms to minimize.
[2023-03-21 07:18:24] [INFO ] Deduced a trap composed of 24 places in 624 ms of which 2 ms to minimize.
[2023-03-21 07:18:25] [INFO ] Deduced a trap composed of 27 places in 664 ms of which 1 ms to minimize.
[2023-03-21 07:18:26] [INFO ] Deduced a trap composed of 25 places in 601 ms of which 1 ms to minimize.
[2023-03-21 07:18:27] [INFO ] Deduced a trap composed of 34 places in 641 ms of which 2 ms to minimize.
[2023-03-21 07:18:27] [INFO ] Deduced a trap composed of 25 places in 616 ms of which 2 ms to minimize.
[2023-03-21 07:18:28] [INFO ] Deduced a trap composed of 21 places in 659 ms of which 1 ms to minimize.
[2023-03-21 07:18:29] [INFO ] Deduced a trap composed of 39 places in 603 ms of which 1 ms to minimize.
[2023-03-21 07:18:29] [INFO ] Deduced a trap composed of 34 places in 572 ms of which 4 ms to minimize.
[2023-03-21 07:18:30] [INFO ] Deduced a trap composed of 30 places in 586 ms of which 2 ms to minimize.
[2023-03-21 07:18:31] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 1 ms to minimize.
[2023-03-21 07:18:31] [INFO ] Deduced a trap composed of 33 places in 465 ms of which 1 ms to minimize.
[2023-03-21 07:18:32] [INFO ] Deduced a trap composed of 29 places in 440 ms of which 2 ms to minimize.
[2023-03-21 07:18:33] [INFO ] Deduced a trap composed of 38 places in 422 ms of which 1 ms to minimize.
[2023-03-21 07:18:33] [INFO ] Deduced a trap composed of 42 places in 373 ms of which 1 ms to minimize.
[2023-03-21 07:18:34] [INFO ] Deduced a trap composed of 35 places in 423 ms of which 1 ms to minimize.
[2023-03-21 07:18:34] [INFO ] Deduced a trap composed of 30 places in 446 ms of which 1 ms to minimize.
[2023-03-21 07:18:35] [INFO ] Deduced a trap composed of 15 places in 516 ms of which 2 ms to minimize.
[2023-03-21 07:18:35] [INFO ] Deduced a trap composed of 31 places in 479 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 07:18:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:18:35] [INFO ] After 25245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 576 ms.
Support contains 82 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 2003 transition count 2075
Reduce places removed 178 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 188 rules applied. Total rules applied 366 place count 1825 transition count 2065
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 376 place count 1815 transition count 2065
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 376 place count 1815 transition count 1817
Deduced a syphon composed of 248 places in 7 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 872 place count 1567 transition count 1817
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 1187 place count 1252 transition count 1502
Iterating global reduction 3 with 315 rules applied. Total rules applied 1502 place count 1252 transition count 1502
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 1502 place count 1252 transition count 1378
Deduced a syphon composed of 124 places in 7 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 1750 place count 1128 transition count 1378
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 3 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2426 place count 790 transition count 1040
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 3 with 88 rules applied. Total rules applied 2514 place count 790 transition count 1040
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2515 place count 789 transition count 1039
Applied a total of 2515 rules in 670 ms. Remains 789 /2003 variables (removed 1214) and now considering 1039/2253 (removed 1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 789/2003 places, 1039/2253 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 7) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1039 rows 789 cols
[2023-03-21 07:18:37] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-21 07:18:37] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 07:18:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-21 07:18:38] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 07:18:38] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-21 07:18:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 153 ms
[2023-03-21 07:18:38] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 3 ms to minimize.
[2023-03-21 07:18:39] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2023-03-21 07:18:39] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 1 ms to minimize.
[2023-03-21 07:18:39] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-21 07:18:40] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-21 07:18:40] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2023-03-21 07:18:40] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 2 ms to minimize.
[2023-03-21 07:18:40] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-21 07:18:41] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-21 07:18:41] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2023-03-21 07:18:41] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 1 ms to minimize.
[2023-03-21 07:18:41] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-21 07:18:42] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 0 ms to minimize.
[2023-03-21 07:18:42] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-21 07:18:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3561 ms
[2023-03-21 07:18:42] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2023-03-21 07:18:42] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2023-03-21 07:18:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-21 07:18:42] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2023-03-21 07:18:43] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2023-03-21 07:18:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2023-03-21 07:18:43] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-21 07:18:43] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-21 07:18:43] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-21 07:18:43] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 7 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2023-03-21 07:18:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1808 ms
[2023-03-21 07:18:45] [INFO ] After 7133ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-21 07:18:45] [INFO ] After 7493ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 21 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1039/1039 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 789 transition count 1034
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 784 transition count 1034
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 10 place count 784 transition count 1024
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 30 place count 774 transition count 1024
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 773 transition count 1023
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 773 transition count 1023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 773 transition count 1022
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 772 transition count 1022
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 116 place count 731 transition count 981
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 731 transition count 981
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 137 place count 724 transition count 974
Applied a total of 137 rules in 215 ms. Remains 724 /789 variables (removed 65) and now considering 974/1039 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 724/789 places, 974/1039 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 974 rows 724 cols
[2023-03-21 07:18:45] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-21 07:18:45] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-21 07:18:46] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:18:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-21 07:18:46] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 907 ms
[2023-03-21 07:18:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-21 07:18:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-21 07:18:48] [INFO ] After 1636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-21 07:18:48] [INFO ] After 1935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 27 ms.
Support contains 12 out of 724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 974/974 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 724 transition count 972
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 722 transition count 972
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 717 transition count 967
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 715 transition count 965
Applied a total of 16 rules in 92 ms. Remains 715 /724 variables (removed 9) and now considering 965/974 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 715/724 places, 965/974 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 197244 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197244 steps, saw 189199 distinct states, run finished after 3006 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 965 rows 715 cols
[2023-03-21 07:18:51] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-21 07:18:51] [INFO ] [Real]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-21 07:18:51] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:18:51] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-21 07:18:52] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:18:52] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2023-03-21 07:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-21 07:18:52] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-21 07:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-21 07:18:52] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-21 07:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-21 07:18:52] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-21 07:18:52] [INFO ] After 1206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 12 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 965/965 transitions.
Applied a total of 0 rules in 26 ms. Remains 715 /715 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 715/715 places, 965/965 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 965/965 transitions.
Applied a total of 0 rules in 31 ms. Remains 715 /715 variables (removed 0) and now considering 965/965 (removed 0) transitions.
[2023-03-21 07:18:53] [INFO ] Invariant cache hit.
[2023-03-21 07:18:53] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-21 07:18:53] [INFO ] Invariant cache hit.
[2023-03-21 07:18:54] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2023-03-21 07:18:54] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-21 07:18:54] [INFO ] Invariant cache hit.
[2023-03-21 07:18:54] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1695 ms. Remains : 715/715 places, 965/965 transitions.
Applied a total of 0 rules in 25 ms. Remains 715 /715 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-21 07:18:54] [INFO ] Invariant cache hit.
[2023-03-21 07:18:54] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-21 07:18:54] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:18:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-21 07:18:55] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:18:55] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-21 07:18:55] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2023-03-21 07:18:55] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-21 07:18:55] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-21 07:18:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 537 ms
[2023-03-21 07:18:56] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-21 07:18:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-21 07:18:56] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-21 07:18:56] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-21 07:18:56] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-21 07:18:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2023-03-21 07:18:56] [INFO ] After 1553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-21 07:18:56] [INFO ] After 1824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 07:18:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-21 07:18:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 715 places, 965 transitions and 4682 arcs took 7 ms.
[2023-03-21 07:18:57] [INFO ] Flatten gal took : 149 ms
Total runtime 48303 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVs (PT), instance 050B
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: 715 places, 965 transitions, 4682 arcs.
Final Score: 20391.754
Took : 48 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldRVs-PT-050B-ReachabilityCardinality-07 (reachable & potential(( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( ( (tk(P376)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P376)) ) ) & ( ( (tk(P444)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P444)) ) ) ) )))
PROPERTY: ShieldRVs-PT-050B-ReachabilityCardinality-10 (reachable & potential(( ( ( ( (tk(P522)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P522)) ) ) & ( ( (tk(P362)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P362)) ) ) ) & ( ( ( (tk(P486)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P486)) ) ) & ( ( ( (tk(P395)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P395)) ) ) & ( ( (tk(P220)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P220)) ) ) ) ) )))
PROPERTY: ShieldRVs-PT-050B-ReachabilityCardinality-11 (reachable &!potential( ( ( ( ( (tk(P180)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P180)) ) ) | ( ( (tk(P557)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P557)) ) ) ) | ( ( ( (tk(P263)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P263)) ) ) | ( ( (tk(P128)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P128)) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4446680 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16104388 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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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 r427-tajo-167905979300158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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