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-167905979500319.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 ShieldRVt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979500319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 489K 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 ShieldRVt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679384443656

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=ShieldRVt-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:40:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 07:40:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:40:45] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-21 07:40:45] [INFO ] Transformed 2003 places.
[2023-03-21 07:40:45] [INFO ] Transformed 2003 transitions.
[2023-03-21 07:40:45] [INFO ] Found NUPN structural information;
[2023-03-21 07:40:45] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 789 ms. (steps per millisecond=12 ) properties (out of 16) seen :7
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-21 07:40:47] [INFO ] Computed 161 place invariants in 41 ms
[2023-03-21 07:40:48] [INFO ] After 888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 07:40:49] [INFO ] [Nat]Absence check using 161 positive place invariants in 80 ms returned sat
[2023-03-21 07:40:55] [INFO ] After 6526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 07:40:57] [INFO ] Deduced a trap composed of 35 places in 720 ms of which 7 ms to minimize.
[2023-03-21 07:41:13] [INFO ] Deduced a trap composed of 19 places in 15888 ms of which 2 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:41:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:41:13] [INFO ] After 25125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 893 ms.
Support contains 116 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 520 transitions
Trivial Post-agglo rules discarded 520 transitions
Performed 520 trivial Post agglomeration. Transition count delta: 520
Iterating post reduction 0 with 520 rules applied. Total rules applied 520 place count 2003 transition count 1483
Reduce places removed 520 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 522 rules applied. Total rules applied 1042 place count 1483 transition count 1481
Reduce places removed 1 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 56 rules applied. Total rules applied 1098 place count 1482 transition count 1426
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1153 place count 1427 transition count 1426
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 163 Pre rules applied. Total rules applied 1153 place count 1427 transition count 1263
Deduced a syphon composed of 163 places in 2 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 4 with 326 rules applied. Total rules applied 1479 place count 1264 transition count 1263
Discarding 251 places :
Symmetric choice reduction at 4 with 251 rule applications. Total rules 1730 place count 1013 transition count 1012
Iterating global reduction 4 with 251 rules applied. Total rules applied 1981 place count 1013 transition count 1012
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 92 Pre rules applied. Total rules applied 1981 place count 1013 transition count 920
Deduced a syphon composed of 92 places in 4 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 2165 place count 921 transition count 920
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 1 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 4 with 644 rules applied. Total rules applied 2809 place count 599 transition count 598
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 2989 place count 509 transition count 657
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2990 place count 509 transition count 656
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 2997 place count 509 transition count 649
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 3004 place count 502 transition count 649
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 3008 place count 502 transition count 645
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3010 place count 502 transition count 645
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3011 place count 501 transition count 644
Applied a total of 3011 rules in 778 ms. Remains 501 /2003 variables (removed 1502) and now considering 644/2003 (removed 1359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 501/2003 places, 644/2003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 644 rows 501 cols
[2023-03-21 07:41:16] [INFO ] Computed 161 place invariants in 7 ms
[2023-03-21 07:41:16] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 07:41:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2023-03-21 07:41:18] [INFO ] After 1334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 07:41:18] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-03-21 07:41:18] [INFO ] After 930ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 07:41:19] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-21 07:41:23] [INFO ] Deduced a trap composed of 11 places in 3809 ms of which 28 ms to minimize.
[2023-03-21 07:41:23] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-21 07:41:23] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2023-03-21 07:41:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4285 ms
[2023-03-21 07:41:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-03-21 07:41:26] [INFO ] Deduced a trap composed of 11 places in 3256 ms of which 26 ms to minimize.
[2023-03-21 07:41:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3438 ms
[2023-03-21 07:41:27] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2023-03-21 07:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-21 07:41:27] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-03-21 07:41:27] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-21 07:41:27] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2023-03-21 07:41:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 374 ms
[2023-03-21 07:41:27] [INFO ] After 9830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 838 ms.
[2023-03-21 07:41:28] [INFO ] After 12242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 80 ms.
Support contains 99 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 644/644 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 640
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 497 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 496 transition count 639
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 10 place count 496 transition count 631
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 26 place count 488 transition count 631
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 480 transition count 623
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 478 transition count 625
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 478 transition count 623
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 476 transition count 623
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 476 transition count 622
Applied a total of 51 rules in 86 ms. Remains 476 /501 variables (removed 25) and now considering 622/644 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 476/501 places, 622/644 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) 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 8) seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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
Running SMT prover for 7 properties.
// Phase 1: matrix 622 rows 476 cols
[2023-03-21 07:41:29] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-21 07:41:29] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 07:41:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned sat
[2023-03-21 07:41:30] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 07:41:30] [INFO ] State equation strengthened by 246 read => feed constraints.
[2023-03-21 07:41:30] [INFO ] After 534ms SMT Verify possible using 246 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-21 07:41:30] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2023-03-21 07:41:30] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-21 07:41:31] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-21 07:41:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2023-03-21 07:41:31] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2023-03-21 07:41:31] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-21 07:41:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-03-21 07:41:31] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2023-03-21 07:41:31] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-21 07:41:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-03-21 07:41:32] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-21 07:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-21 07:41:32] [INFO ] After 2059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 884 ms.
[2023-03-21 07:41:33] [INFO ] After 3516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 97 ms.
Support contains 98 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 622/622 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 475 transition count 621
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 474 transition count 622
Applied a total of 4 rules in 27 ms. Remains 474 /476 variables (removed 2) and now considering 622/622 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 474/476 places, 622/622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 7) seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 622 rows 474 cols
[2023-03-21 07:41:33] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-21 07:41:34] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 07:41:34] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned sat
[2023-03-21 07:41:34] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 07:41:34] [INFO ] State equation strengthened by 249 read => feed constraints.
[2023-03-21 07:41:35] [INFO ] After 667ms SMT Verify possible using 249 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 07:41:35] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2023-03-21 07:41:35] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-03-21 07:41:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2023-03-21 07:41:35] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-21 07:41:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-21 07:41:36] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-21 07:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-21 07:41:36] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2023-03-21 07:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-21 07:41:36] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2023-03-21 07:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-21 07:41:36] [INFO ] After 1991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 755 ms.
[2023-03-21 07:41:37] [INFO ] After 3256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 131 ms.
Support contains 84 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 622/622 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 474 transition count 619
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 471 transition count 619
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 471 transition count 614
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 466 transition count 614
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 456 transition count 604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 454 transition count 608
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 454 transition count 607
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 454 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 453 transition count 606
Applied a total of 43 rules in 99 ms. Remains 453 /474 variables (removed 21) and now considering 606/622 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 453/474 places, 606/622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 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 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 150796 steps, run timeout after 3010 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150796 steps, saw 90114 distinct states, run finished after 3012 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 606 rows 453 cols
[2023-03-21 07:41:41] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-21 07:41:41] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 07:41:41] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-21 07:41:41] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 07:41:41] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-21 07:41:42] [INFO ] After 781ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 07:41:42] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-21 07:41:42] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-21 07:41:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-21 07:41:43] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2023-03-21 07:41:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 451 ms
[2023-03-21 07:41:43] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 11 ms to minimize.
[2023-03-21 07:41:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-21 07:41:43] [INFO ] After 1982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 625 ms.
[2023-03-21 07:41:44] [INFO ] After 3024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 116 ms.
Support contains 84 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 606/606 transitions.
Applied a total of 0 rules in 20 ms. Remains 453 /453 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 453/453 places, 606/606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 606/606 transitions.
Applied a total of 0 rules in 42 ms. Remains 453 /453 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2023-03-21 07:41:44] [INFO ] Invariant cache hit.
[2023-03-21 07:41:44] [INFO ] Implicit Places using invariants in 270 ms returned [443]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 274 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 452/453 places, 606/606 transitions.
Applied a total of 0 rules in 13 ms. Remains 452 /452 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 329 ms. Remains : 452/453 places, 606/606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-05 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 606 rows 452 cols
[2023-03-21 07:41:45] [INFO ] Computed 160 place invariants in 4 ms
[2023-03-21 07:41:45] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 07:41:45] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-21 07:41:45] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 07:41:45] [INFO ] State equation strengthened by 257 read => feed constraints.
[2023-03-21 07:41:46] [INFO ] After 538ms SMT Verify possible using 257 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 07:41:46] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-21 07:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-21 07:41:46] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-21 07:41:46] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-21 07:41:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2023-03-21 07:41:47] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-03-21 07:41:47] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2023-03-21 07:41:47] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-21 07:41:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 460 ms
[2023-03-21 07:41:47] [INFO ] After 1805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 422 ms.
[2023-03-21 07:41:47] [INFO ] After 2589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 106 ms.
Support contains 62 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 606/606 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 452 transition count 601
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 447 transition count 601
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 447 transition count 595
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 441 transition count 595
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 52 place count 426 transition count 580
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 419 transition count 586
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 419 transition count 585
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 417 transition count 583
Applied a total of 69 rules in 63 ms. Remains 417 /452 variables (removed 35) and now considering 583/606 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 417/452 places, 583/606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) 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
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 200129 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200129 steps, saw 118236 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 583 rows 417 cols
[2023-03-21 07:41:51] [INFO ] Computed 160 place invariants in 5 ms
[2023-03-21 07:41:51] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 07:41:51] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-21 07:41:51] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 07:41:51] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-21 07:41:52] [INFO ] After 379ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 07:41:52] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2023-03-21 07:41:52] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-21 07:41:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-21 07:41:52] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-21 07:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-21 07:41:52] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-21 07:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-21 07:41:53] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-21 07:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-21 07:41:53] [INFO ] After 1260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-21 07:41:53] [INFO ] After 1956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 73 ms.
Support contains 62 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 583/583 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 417/417 places, 583/583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 583/583 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2023-03-21 07:41:53] [INFO ] Invariant cache hit.
[2023-03-21 07:41:53] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-21 07:41:53] [INFO ] Invariant cache hit.
[2023-03-21 07:41:54] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-21 07:41:55] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2023-03-21 07:41:55] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-21 07:41:55] [INFO ] Invariant cache hit.
[2023-03-21 07:41:55] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2261 ms. Remains : 417/417 places, 583/583 transitions.
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 417 transition count 565
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 38 place count 417 transition count 565
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 53 place count 417 transition count 550
Applied a total of 53 rules in 78 ms. Remains 417 /417 variables (removed 0) and now considering 550/583 (removed 33) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 550 rows 417 cols
[2023-03-21 07:41:55] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-21 07:41:56] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 07:41:56] [INFO ] [Nat]Absence check using 160 positive place invariants in 23 ms returned sat
[2023-03-21 07:41:56] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 07:41:56] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-21 07:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-21 07:41:56] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-21 07:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-21 07:41:56] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-21 07:41:57] [INFO ] After 1041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-21 07:41:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2023-03-21 07:41:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 417 places, 583 transitions and 2940 arcs took 3 ms.
[2023-03-21 07:41:57] [INFO ] Flatten gal took : 136 ms
Total runtime 72157 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (PT), instance 040B
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: 417 places, 583 transitions, 2940 arcs.
Final Score: 8407.476
Took : 24 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679384542983

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 3992:
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="ShieldRVt-PT-040B"
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 ShieldRVt-PT-040B, 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-167905979500319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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