Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903718600335.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 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.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 860K 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 ShieldIIPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679563864329

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=ShieldIIPt-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:31:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 09:31:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:31:07] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-23 09:31:07] [INFO ] Transformed 3503 places.
[2023-03-23 09:31:07] [INFO ] Transformed 3253 transitions.
[2023-03-23 09:31:07] [INFO ] Found NUPN structural information;
[2023-03-23 09:31:07] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 16) seen :3
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-23 09:31:08] [INFO ] Computed 451 place invariants in 36 ms
[2023-03-23 09:31:11] [INFO ] [Real]Absence check using 451 positive place invariants in 356 ms returned sat
[2023-03-23 09:31:14] [INFO ] After 5806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-23 09:31:16] [INFO ] [Nat]Absence check using 451 positive place invariants in 337 ms returned sat
[2023-03-23 09:31:28] [INFO ] After 11826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-23 09:31:30] [INFO ] Deduced a trap composed of 38 places in 1799 ms of which 28 ms to minimize.
[2023-03-23 09:31:32] [INFO ] Deduced a trap composed of 30 places in 1725 ms of which 15 ms to minimize.
[2023-03-23 09:31:34] [INFO ] Deduced a trap composed of 27 places in 1553 ms of which 3 ms to minimize.
[2023-03-23 09:31:35] [INFO ] Deduced a trap composed of 17 places in 1080 ms of which 12 ms to minimize.
[2023-03-23 09:31:36] [INFO ] Deduced a trap composed of 36 places in 1156 ms of which 3 ms to minimize.
[2023-03-23 09:31:38] [INFO ] Deduced a trap composed of 38 places in 1021 ms of which 2 ms to minimize.
[2023-03-23 09:31:39] [INFO ] Deduced a trap composed of 48 places in 1373 ms of which 3 ms to minimize.
[2023-03-23 09:31:39] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 10646 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 09:31:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 09:31:39] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 2836 ms.
Support contains 118 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 764 transitions
Trivial Post-agglo rules discarded 764 transitions
Performed 764 trivial Post agglomeration. Transition count delta: 764
Iterating post reduction 0 with 764 rules applied. Total rules applied 764 place count 3503 transition count 2489
Reduce places removed 764 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 766 rules applied. Total rules applied 1530 place count 2739 transition count 2487
Reduce places removed 1 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 45 rules applied. Total rules applied 1575 place count 2738 transition count 2443
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1619 place count 2694 transition count 2443
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1619 place count 2694 transition count 2237
Deduced a syphon composed of 206 places in 23 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 2031 place count 2488 transition count 2237
Discarding 316 places :
Symmetric choice reduction at 4 with 316 rule applications. Total rules 2347 place count 2172 transition count 1921
Iterating global reduction 4 with 316 rules applied. Total rules applied 2663 place count 2172 transition count 1921
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 2663 place count 2172 transition count 1796
Deduced a syphon composed of 125 places in 12 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 2913 place count 2047 transition count 1796
Performed 802 Post agglomeration using F-continuation condition.Transition count delta: 802
Deduced a syphon composed of 802 places in 3 ms
Reduce places removed 802 places and 0 transitions.
Iterating global reduction 4 with 1604 rules applied. Total rules applied 4517 place count 1245 transition count 994
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4719 place count 1144 transition count 1044
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 4767 place count 1120 transition count 1058
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4768 place count 1120 transition count 1057
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 4773 place count 1120 transition count 1052
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4778 place count 1115 transition count 1052
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 4824 place count 1115 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4825 place count 1114 transition count 1051
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4827 place count 1112 transition count 1051
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4827 place count 1112 transition count 1050
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4829 place count 1111 transition count 1050
Applied a total of 4829 rules in 1100 ms. Remains 1111 /3503 variables (removed 2392) and now considering 1050/3253 (removed 2203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1100 ms. Remains : 1111/3503 places, 1050/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) 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 13) seen :0
Interrupted probabilistic random walk after 79043 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79043 steps, saw 67095 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1050 rows 1111 cols
[2023-03-23 09:31:48] [INFO ] Computed 449 place invariants in 5 ms
[2023-03-23 09:31:48] [INFO ] [Real]Absence check using 449 positive place invariants in 126 ms returned sat
[2023-03-23 09:31:49] [INFO ] After 1119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-23 09:31:49] [INFO ] [Nat]Absence check using 449 positive place invariants in 125 ms returned sat
[2023-03-23 09:31:51] [INFO ] After 1576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-23 09:31:51] [INFO ] State equation strengthened by 334 read => feed constraints.
[2023-03-23 09:31:55] [INFO ] After 3347ms SMT Verify possible using 334 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-23 09:31:55] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-23 09:31:55] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-23 09:31:55] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2023-03-23 09:31:56] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-23 09:31:56] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-23 09:31:56] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-23 09:31:56] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-23 09:31:57] [INFO ] Deduced a trap composed of 10 places in 484 ms of which 14 ms to minimize.
[2023-03-23 09:31:57] [INFO ] Deduced a trap composed of 10 places in 410 ms of which 0 ms to minimize.
[2023-03-23 09:31:57] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-23 09:31:58] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-23 09:31:58] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-23 09:31:58] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-23 09:31:58] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-23 09:31:58] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 27 ms to minimize.
[2023-03-23 09:31:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3602 ms
[2023-03-23 09:32:00] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-23 09:32:00] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-23 09:32:00] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-23 09:32:00] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 0 ms to minimize.
[2023-03-23 09:32:01] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-23 09:32:01] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-23 09:32:01] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-23 09:32:02] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-23 09:32:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2185 ms
[2023-03-23 09:32:04] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-23 09:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-23 09:32:05] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 0 ms to minimize.
[2023-03-23 09:32:05] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-23 09:32:05] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2023-03-23 09:32:05] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-23 09:32:06] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2023-03-23 09:32:06] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2023-03-23 09:32:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1761 ms
[2023-03-23 09:32:06] [INFO ] After 14993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 5836 ms.
[2023-03-23 09:32:12] [INFO ] After 23438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 789 ms.
Support contains 118 out of 1111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1050/1050 transitions.
Applied a total of 0 rules in 53 ms. Remains 1111 /1111 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1111/1111 places, 1050/1050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1050/1050 transitions.
Applied a total of 0 rules in 42 ms. Remains 1111 /1111 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
[2023-03-23 09:32:13] [INFO ] Invariant cache hit.
[2023-03-23 09:32:14] [INFO ] Implicit Places using invariants in 721 ms returned [1099]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 737 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1110/1111 places, 1050/1050 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1109 transition count 1049
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1109 transition count 1049
Applied a total of 2 rules in 51 ms. Remains 1109 /1110 variables (removed 1) and now considering 1049/1050 (removed 1) transitions.
// Phase 1: matrix 1049 rows 1109 cols
[2023-03-23 09:32:14] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-23 09:32:14] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-23 09:32:14] [INFO ] Invariant cache hit.
[2023-03-23 09:32:15] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-23 09:32:19] [INFO ] Implicit Places using invariants and state equation in 4907 ms returned []
Implicit Place search using SMT with State Equation took 5462 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1109/1111 places, 1049/1050 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6292 ms. Remains : 1109/1111 places, 1049/1050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 13) seen :2
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-23 09:32:21] [INFO ] Invariant cache hit.
[2023-03-23 09:32:21] [INFO ] [Real]Absence check using 448 positive place invariants in 147 ms returned sat
[2023-03-23 09:32:22] [INFO ] After 1085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 09:32:23] [INFO ] [Nat]Absence check using 448 positive place invariants in 125 ms returned sat
[2023-03-23 09:32:24] [INFO ] After 1532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 09:32:24] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-23 09:32:28] [INFO ] After 3669ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 09:32:28] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 16 ms to minimize.
[2023-03-23 09:32:29] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 18 ms to minimize.
[2023-03-23 09:32:29] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-23 09:32:29] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-23 09:32:29] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 14 ms to minimize.
[2023-03-23 09:32:29] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-23 09:32:29] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-23 09:32:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1372 ms
[2023-03-23 09:32:31] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-23 09:32:31] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-03-23 09:32:31] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-23 09:32:31] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-23 09:32:32] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-23 09:32:32] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2023-03-23 09:32:32] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-23 09:32:32] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-23 09:32:33] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 0 ms to minimize.
[2023-03-23 09:32:34] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2023-03-23 09:32:34] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 16 ms to minimize.
[2023-03-23 09:32:35] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-23 09:32:35] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-23 09:32:35] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-23 09:32:35] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5445 ms
[2023-03-23 09:32:36] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-23 09:32:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-23 09:32:37] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 13 ms to minimize.
[2023-03-23 09:32:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2023-03-23 09:32:38] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 6 ms to minimize.
[2023-03-23 09:32:39] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 10 ms to minimize.
[2023-03-23 09:32:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1031 ms
[2023-03-23 09:32:39] [INFO ] After 14523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3689 ms.
[2023-03-23 09:32:43] [INFO ] After 20729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1824 ms.
Support contains 92 out of 1109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1109/1109 places, 1049/1049 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 1109 transition count 1046
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1106 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1105 transition count 1045
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 8 place count 1105 transition count 1037
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 24 place count 1097 transition count 1037
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 58 place count 1080 transition count 1020
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 1078 transition count 1021
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 65 place count 1078 transition count 1021
Applied a total of 65 rules in 115 ms. Remains 1078 /1109 variables (removed 31) and now considering 1021/1049 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1078/1109 places, 1021/1049 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 65979 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65979 steps, saw 58440 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1021 rows 1078 cols
[2023-03-23 09:32:49] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-23 09:32:49] [INFO ] [Real]Absence check using 448 positive place invariants in 93 ms returned sat
[2023-03-23 09:32:50] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 09:32:50] [INFO ] [Nat]Absence check using 448 positive place invariants in 113 ms returned sat
[2023-03-23 09:32:52] [INFO ] After 1357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 09:32:52] [INFO ] State equation strengthened by 346 read => feed constraints.
[2023-03-23 09:32:56] [INFO ] After 3932ms SMT Verify possible using 346 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 09:32:56] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-23 09:32:57] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2023-03-23 09:32:57] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-23 09:32:57] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2023-03-23 09:32:57] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 11 ms to minimize.
[2023-03-23 09:32:58] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 0 ms to minimize.
[2023-03-23 09:32:58] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-23 09:32:58] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-23 09:32:58] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2023-03-23 09:32:59] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-23 09:32:59] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-23 09:32:59] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-23 09:32:59] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-23 09:32:59] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2023-03-23 09:33:00] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-23 09:33:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3620 ms
[2023-03-23 09:33:01] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-23 09:33:01] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2023-03-23 09:33:01] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-23 09:33:02] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2023-03-23 09:33:02] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-23 09:33:02] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-23 09:33:02] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-23 09:33:03] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-23 09:33:03] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-23 09:33:03] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-23 09:33:03] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-23 09:33:04] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-23 09:33:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3076 ms
[2023-03-23 09:33:04] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 0 ms to minimize.
[2023-03-23 09:33:05] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-23 09:33:05] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-23 09:33:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 649 ms
[2023-03-23 09:33:07] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-23 09:33:07] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-23 09:33:07] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-23 09:33:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 806 ms
[2023-03-23 09:33:07] [INFO ] After 15366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3958 ms.
[2023-03-23 09:33:11] [INFO ] After 21646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 649 ms.
Support contains 92 out of 1078 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1078/1078 places, 1021/1021 transitions.
Applied a total of 0 rules in 29 ms. Remains 1078 /1078 variables (removed 0) and now considering 1021/1021 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1078/1078 places, 1021/1021 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1078/1078 places, 1021/1021 transitions.
Applied a total of 0 rules in 28 ms. Remains 1078 /1078 variables (removed 0) and now considering 1021/1021 (removed 0) transitions.
[2023-03-23 09:33:12] [INFO ] Invariant cache hit.
[2023-03-23 09:33:13] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2023-03-23 09:33:13] [INFO ] Invariant cache hit.
[2023-03-23 09:33:14] [INFO ] State equation strengthened by 346 read => feed constraints.
[2023-03-23 09:33:17] [INFO ] Implicit Places using invariants and state equation in 4202 ms returned []
Implicit Place search using SMT with State Equation took 5258 ms to find 0 implicit places.
[2023-03-23 09:33:18] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-23 09:33:18] [INFO ] Invariant cache hit.
[2023-03-23 09:33:18] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6263 ms. Remains : 1078/1078 places, 1021/1021 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1078 transition count 1020
Partial Free-agglomeration rule applied 184 times.
Drop transitions removed 184 transitions
Iterating global reduction 0 with 184 rules applied. Total rules applied 185 place count 1078 transition count 1020
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 1078 transition count 1019
Applied a total of 186 rules in 105 ms. Remains 1078 /1078 variables (removed 0) and now considering 1019/1021 (removed 2) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1019 rows 1078 cols
[2023-03-23 09:33:19] [INFO ] Computed 448 place invariants in 9 ms
[2023-03-23 09:33:19] [INFO ] [Real]Absence check using 448 positive place invariants in 121 ms returned sat
[2023-03-23 09:33:20] [INFO ] After 1278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 09:33:20] [INFO ] [Nat]Absence check using 448 positive place invariants in 199 ms returned sat
[2023-03-23 09:33:22] [INFO ] After 1534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 09:33:22] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-23 09:33:24] [INFO ] After 1296ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 09:33:24] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-23 09:33:24] [INFO ] Deduced a trap composed of 9 places in 423 ms of which 1 ms to minimize.
[2023-03-23 09:33:25] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-23 09:33:25] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-23 09:33:25] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2023-03-23 09:33:25] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2023-03-23 09:33:25] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-23 09:33:26] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2023-03-23 09:33:26] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-23 09:33:26] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-23 09:33:26] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-23 09:33:26] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-23 09:33:27] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-23 09:33:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3111 ms
[2023-03-23 09:33:28] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-23 09:33:28] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-23 09:33:28] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-23 09:33:28] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2023-03-23 09:33:28] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 13 ms to minimize.
[2023-03-23 09:33:29] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-23 09:33:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1420 ms
[2023-03-23 09:33:30] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-23 09:33:30] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-23 09:33:30] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-23 09:33:31] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-23 09:33:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 944 ms
[2023-03-23 09:33:31] [INFO ] After 8660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1307 ms.
[2023-03-23 09:33:32] [INFO ] After 12491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-23 09:33:32] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 21 ms.
[2023-03-23 09:33:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1078 places, 1021 transitions and 4920 arcs took 12 ms.
[2023-03-23 09:33:33] [INFO ] Flatten gal took : 139 ms
Total runtime 146439 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (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: 1078 places, 1021 transitions, 4920 arcs.
Final Score: 90410.837
Took : 48 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679564062031

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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 7036:
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="ShieldIIPt-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 ShieldIIPt-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 r395-oct2-167903718600335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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