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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 370K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679379558066

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 06:19:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 06:19:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:19:19] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-21 06:19:19] [INFO ] Transformed 1203 places.
[2023-03-21 06:19:19] [INFO ] Transformed 1353 transitions.
[2023-03-21 06:19:19] [INFO ] Found NUPN structural information;
[2023-03-21 06:19:19] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-21 06:19:20] [INFO ] Computed 121 place invariants in 22 ms
[2023-03-21 06:19:21] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 06:19:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 38 ms returned sat
[2023-03-21 06:19:23] [INFO ] After 2032ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 06:19:24] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 10 ms to minimize.
[2023-03-21 06:19:24] [INFO ] Deduced a trap composed of 30 places in 466 ms of which 2 ms to minimize.
[2023-03-21 06:19:25] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 2 ms to minimize.
[2023-03-21 06:19:25] [INFO ] Deduced a trap composed of 45 places in 346 ms of which 3 ms to minimize.
[2023-03-21 06:19:26] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2023-03-21 06:19:26] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 1 ms to minimize.
[2023-03-21 06:19:27] [INFO ] Deduced a trap composed of 37 places in 346 ms of which 1 ms to minimize.
[2023-03-21 06:19:27] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 7 ms to minimize.
[2023-03-21 06:19:27] [INFO ] Deduced a trap composed of 52 places in 327 ms of which 1 ms to minimize.
[2023-03-21 06:19:28] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 0 ms to minimize.
[2023-03-21 06:19:28] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 0 ms to minimize.
[2023-03-21 06:19:28] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 0 ms to minimize.
[2023-03-21 06:19:29] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 1 ms to minimize.
[2023-03-21 06:19:29] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 0 ms to minimize.
[2023-03-21 06:19:29] [INFO ] Deduced a trap composed of 36 places in 271 ms of which 1 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 0 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 1 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 1 ms to minimize.
[2023-03-21 06:19:31] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 1 ms to minimize.
[2023-03-21 06:19:31] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 0 ms to minimize.
[2023-03-21 06:19:32] [INFO ] Deduced a trap composed of 26 places in 388 ms of which 3 ms to minimize.
[2023-03-21 06:19:32] [INFO ] Deduced a trap composed of 27 places in 350 ms of which 1 ms to minimize.
[2023-03-21 06:19:32] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 1 ms to minimize.
[2023-03-21 06:19:33] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 0 ms to minimize.
[2023-03-21 06:19:33] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 1 ms to minimize.
[2023-03-21 06:19:33] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
[2023-03-21 06:19:34] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 1 ms to minimize.
[2023-03-21 06:19:34] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 2 ms to minimize.
[2023-03-21 06:19:34] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 0 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 1 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 0 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 1 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 1 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 1 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 50 places in 238 ms of which 0 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 1 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 1 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 36 places in 260 ms of which 1 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 2 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 0 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 0 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 1 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 1 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 0 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 0 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 1 ms to minimize.
[2023-03-21 06:19:40] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 0 ms to minimize.
[2023-03-21 06:19:40] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 0 ms to minimize.
[2023-03-21 06:19:40] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 0 ms to minimize.
[2023-03-21 06:19:41] [INFO ] Deduced a trap composed of 39 places in 371 ms of which 2 ms to minimize.
[2023-03-21 06:19:41] [INFO ] Deduced a trap composed of 44 places in 327 ms of which 2 ms to minimize.
[2023-03-21 06:19:41] [INFO ] Deduced a trap composed of 34 places in 330 ms of which 1 ms to minimize.
[2023-03-21 06:19:42] [INFO ] Deduced a trap composed of 29 places in 297 ms of which 1 ms to minimize.
[2023-03-21 06:19:42] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 1 ms to minimize.
[2023-03-21 06:19:42] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 7 ms to minimize.
[2023-03-21 06:19:43] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 0 ms to minimize.
[2023-03-21 06:19:43] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 1 ms to minimize.
[2023-03-21 06:19:43] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 1 ms to minimize.
[2023-03-21 06:19:44] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 1 ms to minimize.
[2023-03-21 06:19:44] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 1 ms to minimize.
[2023-03-21 06:19:44] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2023-03-21 06:19:45] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 0 ms to minimize.
[2023-03-21 06:19:45] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 1 ms to minimize.
[2023-03-21 06:19:45] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 13 ms to minimize.
[2023-03-21 06:19:45] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 0 ms to minimize.
[2023-03-21 06:19:46] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 2 ms to minimize.
[2023-03-21 06:19:46] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 06:19:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 06:19:46] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 360 ms.
Support contains 177 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 1203 transition count 1264
Reduce places removed 89 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 96 rules applied. Total rules applied 185 place count 1114 transition count 1257
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 1107 transition count 1257
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 192 place count 1107 transition count 1127
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 452 place count 977 transition count 1127
Discarding 167 places :
Symmetric choice reduction at 3 with 167 rule applications. Total rules 619 place count 810 transition count 960
Iterating global reduction 3 with 167 rules applied. Total rules applied 786 place count 810 transition count 960
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 786 place count 810 transition count 913
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 880 place count 763 transition count 913
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 2 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 3 with 368 rules applied. Total rules applied 1248 place count 579 transition count 729
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 3 with 46 rules applied. Total rules applied 1294 place count 579 transition count 729
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1295 place count 578 transition count 728
Applied a total of 1295 rules in 281 ms. Remains 578 /1203 variables (removed 625) and now considering 728/1353 (removed 625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 578/1203 places, 728/1353 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 6) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 728 rows 578 cols
[2023-03-21 06:19:47] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-21 06:19:47] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 06:19:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-21 06:19:48] [INFO ] After 774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 06:19:49] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2023-03-21 06:19:49] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-21 06:19:49] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2023-03-21 06:19:49] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-21 06:19:49] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2023-03-21 06:19:50] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-21 06:19:50] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-21 06:19:50] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2023-03-21 06:19:50] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-21 06:19:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:19:50] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-21 06:19:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1913 ms
[2023-03-21 06:19:51] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-21 06:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-21 06:19:51] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-21 06:19:51] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-21 06:19:51] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2023-03-21 06:19:51] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:19:52] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-21 06:19:53] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-21 06:19:53] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2023-03-21 06:19:53] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2023-03-21 06:19:53] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-21 06:19:53] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2023-03-21 06:19:53] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2023-03-21 06:19:53] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-21 06:19:54] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-21 06:19:54] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2881 ms
[2023-03-21 06:19:54] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2023-03-21 06:19:54] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-21 06:19:54] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-21 06:19:55] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-21 06:19:55] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2023-03-21 06:19:55] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2023-03-21 06:19:55] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-21 06:19:55] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-21 06:19:55] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-21 06:19:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1411 ms
[2023-03-21 06:19:55] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2023-03-21 06:19:56] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2023-03-21 06:19:56] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2023-03-21 06:19:56] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-21 06:19:56] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-03-21 06:19:56] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2023-03-21 06:19:56] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2023-03-21 06:19:56] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-21 06:19:57] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-21 06:19:58] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2023-03-21 06:19:58] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:19:58] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-21 06:19:58] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-21 06:19:58] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2723 ms
[2023-03-21 06:19:58] [INFO ] After 10464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 673 ms.
[2023-03-21 06:19:59] [INFO ] After 11312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 91 ms.
Support contains 161 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 728/728 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 578 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 577 transition count 727
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 577 transition count 723
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 573 transition count 723
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 562 transition count 712
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 562 transition count 712
Applied a total of 35 rules in 79 ms. Remains 562 /578 variables (removed 16) and now considering 712/728 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 562/578 places, 712/728 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) 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 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 230359 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230359 steps, saw 51533 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 712 rows 562 cols
[2023-03-21 06:20:02] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-21 06:20:03] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 06:20:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-21 06:20:03] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 06:20:04] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2023-03-21 06:20:04] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:20:04] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2023-03-21 06:20:04] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-21 06:20:04] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-21 06:20:04] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-21 06:20:04] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-21 06:20:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1081 ms
[2023-03-21 06:20:05] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-21 06:20:05] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-21 06:20:05] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2023-03-21 06:20:06] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-21 06:20:06] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2023-03-21 06:20:06] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-21 06:20:06] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-03-21 06:20:06] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2023-03-21 06:20:06] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:20:06] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-21 06:20:07] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2023-03-21 06:20:07] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-21 06:20:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1948 ms
[2023-03-21 06:20:07] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-21 06:20:07] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2023-03-21 06:20:07] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-21 06:20:07] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-21 06:20:07] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-21 06:20:08] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-21 06:20:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 699 ms
[2023-03-21 06:20:08] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-21 06:20:08] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2023-03-21 06:20:08] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2023-03-21 06:20:08] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2023-03-21 06:20:08] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-21 06:20:08] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2023-03-21 06:20:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2023-03-21 06:20:09] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-03-21 06:20:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 972 ms
[2023-03-21 06:20:09] [INFO ] After 6001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 808 ms.
[2023-03-21 06:20:10] [INFO ] After 6973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 109 ms.
Support contains 161 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 712/712 transitions.
Applied a total of 0 rules in 29 ms. Remains 562 /562 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 562/562 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 712/712 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2023-03-21 06:20:10] [INFO ] Invariant cache hit.
[2023-03-21 06:20:10] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-21 06:20:10] [INFO ] Invariant cache hit.
[2023-03-21 06:20:10] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-21 06:20:11] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-21 06:20:11] [INFO ] Invariant cache hit.
[2023-03-21 06:20:11] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1245 ms. Remains : 562/562 places, 712/712 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-21 06:20:11] [INFO ] Invariant cache hit.
[2023-03-21 06:20:11] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 06:20:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-21 06:20:12] [INFO ] After 883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 06:20:12] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-21 06:20:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1117 ms
[2023-03-21 06:20:14] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-21 06:20:14] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-21 06:20:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2023-03-21 06:20:14] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-21 06:20:14] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-21 06:20:15] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2023-03-21 06:20:15] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-21 06:20:15] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-21 06:20:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1072 ms
[2023-03-21 06:20:15] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-21 06:20:15] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-21 06:20:15] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-03-21 06:20:15] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1021 ms
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-21 06:20:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 401 ms
[2023-03-21 06:20:16] [INFO ] After 5187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 705 ms.
[2023-03-21 06:20:17] [INFO ] After 6101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-21 06:20:17] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-21 06:20:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 712 transitions and 3110 arcs took 7 ms.
[2023-03-21 06:20:18] [INFO ] Flatten gal took : 158 ms
Total runtime 58495 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVs (PT), instance 030B
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: 562 places, 712 transitions, 3110 arcs.
Final Score: 22478.858
Took : 32 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679379650940

--------------------
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 4399:
syntax error

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldRVs-PT-030B, 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-167905979200127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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