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-167905979300159.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979300159
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679383095744

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=ReachabilityFireability
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:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 07:18:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:18:17] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-21 07:18:17] [INFO ] Transformed 2003 places.
[2023-03-21 07:18:17] [INFO ] Transformed 2253 transitions.
[2023-03-21 07:18:17] [INFO ] Found NUPN structural information;
[2023-03-21 07:18:17] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 16) seen :13
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-21 07:18:18] [INFO ] Computed 201 place invariants in 33 ms
[2023-03-21 07:18:18] [INFO ] [Real]Absence check using 201 positive place invariants in 75 ms returned sat
[2023-03-21 07:18:19] [INFO ] After 779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:18:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2023-03-21 07:18:21] [INFO ] After 2107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:18:22] [INFO ] Deduced a trap composed of 16 places in 878 ms of which 9 ms to minimize.
[2023-03-21 07:18:23] [INFO ] Deduced a trap composed of 27 places in 917 ms of which 2 ms to minimize.
[2023-03-21 07:18:24] [INFO ] Deduced a trap composed of 31 places in 851 ms of which 4 ms to minimize.
[2023-03-21 07:18:25] [INFO ] Deduced a trap composed of 28 places in 710 ms of which 3 ms to minimize.
[2023-03-21 07:18:26] [INFO ] Deduced a trap composed of 28 places in 807 ms of which 2 ms to minimize.
[2023-03-21 07:18:27] [INFO ] Deduced a trap composed of 35 places in 648 ms of which 1 ms to minimize.
[2023-03-21 07:18:28] [INFO ] Deduced a trap composed of 29 places in 641 ms of which 2 ms to minimize.
[2023-03-21 07:18:28] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 1 ms to minimize.
[2023-03-21 07:18:29] [INFO ] Deduced a trap composed of 24 places in 753 ms of which 1 ms to minimize.
[2023-03-21 07:18:30] [INFO ] Deduced a trap composed of 33 places in 661 ms of which 1 ms to minimize.
[2023-03-21 07:18:31] [INFO ] Deduced a trap composed of 44 places in 634 ms of which 1 ms to minimize.
[2023-03-21 07:18:33] [INFO ] Deduced a trap composed of 42 places in 2733 ms of which 2 ms to minimize.
[2023-03-21 07:18:34] [INFO ] Deduced a trap composed of 20 places in 666 ms of which 18 ms to minimize.
[2023-03-21 07:18:35] [INFO ] Deduced a trap composed of 23 places in 743 ms of which 17 ms to minimize.
[2023-03-21 07:18:36] [INFO ] Deduced a trap composed of 34 places in 760 ms of which 1 ms to minimize.
[2023-03-21 07:18:37] [INFO ] Deduced a trap composed of 30 places in 803 ms of which 2 ms to minimize.
[2023-03-21 07:18:38] [INFO ] Deduced a trap composed of 33 places in 1052 ms of which 2 ms to minimize.
[2023-03-21 07:18:39] [INFO ] Deduced a trap composed of 32 places in 687 ms of which 1 ms to minimize.
[2023-03-21 07:18:39] [INFO ] Deduced a trap composed of 26 places in 596 ms of which 1 ms to minimize.
[2023-03-21 07:18:40] [INFO ] Deduced a trap composed of 31 places in 749 ms of which 1 ms to minimize.
[2023-03-21 07:18:41] [INFO ] Deduced a trap composed of 37 places in 698 ms of which 3 ms to minimize.
[2023-03-21 07:18:42] [INFO ] Deduced a trap composed of 30 places in 582 ms of which 2 ms to minimize.
[2023-03-21 07:18:43] [INFO ] Deduced a trap composed of 36 places in 717 ms of which 2 ms to minimize.
[2023-03-21 07:18:43] [INFO ] Deduced a trap composed of 34 places in 649 ms of which 2 ms to minimize.
[2023-03-21 07:18:44] [INFO ] Deduced a trap composed of 34 places in 524 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:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:18:44] [INFO ] After 25484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 135 ms.
Support contains 87 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 2003 transition count 2069
Reduce places removed 184 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 188 rules applied. Total rules applied 372 place count 1819 transition count 2065
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 376 place count 1815 transition count 2065
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 376 place count 1815 transition count 1818
Deduced a syphon composed of 247 places in 3 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 870 place count 1568 transition count 1818
Discarding 329 places :
Symmetric choice reduction at 3 with 329 rule applications. Total rules 1199 place count 1239 transition count 1489
Iterating global reduction 3 with 329 rules applied. Total rules applied 1528 place count 1239 transition count 1489
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 1528 place count 1239 transition count 1363
Deduced a syphon composed of 126 places in 6 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 1780 place count 1113 transition count 1363
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 329
Deduced a syphon composed of 329 places in 5 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 3 with 658 rules applied. Total rules applied 2438 place count 784 transition count 1034
Partial Free-agglomeration rule applied 94 times.
Drop transitions removed 94 transitions
Iterating global reduction 3 with 94 rules applied. Total rules applied 2532 place count 784 transition count 1034
Applied a total of 2532 rules in 499 ms. Remains 784 /2003 variables (removed 1219) and now considering 1034/2253 (removed 1219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 784/2003 places, 1034/2253 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1034 rows 784 cols
[2023-03-21 07:18:45] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-21 07:18:45] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-21 07:18:45] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:18:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 37 ms returned sat
[2023-03-21 07:18:46] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:18:46] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-21 07:18:46] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-21 07:18:46] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-21 07:18:47] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-21 07:18:48] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-21 07:18:48] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-21 07:18:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1684 ms
[2023-03-21 07:18:48] [INFO ] After 2071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-21 07:18:48] [INFO ] After 2312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1034/1034 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 784 transition count 1027
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 777 transition count 1027
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 14 place count 777 transition count 1011
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 761 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 760 transition count 1010
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 760 transition count 1010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 760 transition count 1009
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 759 transition count 1009
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 6 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 158 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 168 place count 705 transition count 955
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 704 transition count 954
Applied a total of 169 rules in 298 ms. Remains 704 /784 variables (removed 80) and now considering 954/1034 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 704/784 places, 954/1034 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216185 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216185 steps, saw 135125 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 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 23 ms returned sat
[2023-03-21 07:18:52] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:18:52] [INFO ] [Nat]Absence check using 201 positive place invariants in 58 ms returned sat
[2023-03-21 07:18:52] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:18:52] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-21 07:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-21 07:18:52] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-21 07:18:52] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 22 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 37 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-21 07:18:52] [INFO ] Invariant cache hit.
[2023-03-21 07:18:53] [INFO ] Implicit Places using invariants in 442 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 726 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-21 07:18:54] [INFO ] Redundant transitions in 174 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 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1878 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 36 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 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 25 ms returned sat
[2023-03-21 07:18:55] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:18:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-21 07:18:55] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:18:55] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-21 07:18:55] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-21 07:18:55] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2023-03-21 07:18:56] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2023-03-21 07:18:56] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-21 07:18:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 712 ms
[2023-03-21 07:18:56] [INFO ] After 1011ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-21 07:18:56] [INFO ] After 1227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:18:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2023-03-21 07:18:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 704 places, 954 transitions and 4607 arcs took 16 ms.
[2023-03-21 07:18:56] [INFO ] Flatten gal took : 145 ms
Total runtime 39465 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 ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 704 places, 954 transitions, 4607 arcs.
Final Score: 12307.423
Took : 46 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679383183778

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 6469:
syntax error

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="ReachabilityFireability"
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 ReachabilityFireability"
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-167905979300159"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;