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.r394-oct2-167903718200671.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 marciexred
Input is ShieldPPPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718200671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 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.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 762K 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 ShieldPPPt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679530082324

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:08:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 00:08:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:08:05] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-23 00:08:05] [INFO ] Transformed 3123 places.
[2023-03-23 00:08:05] [INFO ] Transformed 2843 transitions.
[2023-03-23 00:08:05] [INFO ] Found NUPN structural information;
[2023-03-23 00:08:05] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-23 00:08:07] [INFO ] Computed 441 place invariants in 46 ms
[2023-03-23 00:08:08] [INFO ] After 1499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 00:08:10] [INFO ] [Nat]Absence check using 441 positive place invariants in 389 ms returned sat
[2023-03-23 00:08:22] [INFO ] After 10987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 00:08:23] [INFO ] Deduced a trap composed of 20 places in 945 ms of which 27 ms to minimize.
[2023-03-23 00:08:25] [INFO ] Deduced a trap composed of 25 places in 1605 ms of which 6 ms to minimize.
[2023-03-23 00:08:26] [INFO ] Deduced a trap composed of 18 places in 1072 ms of which 17 ms to minimize.
[2023-03-23 00:08:27] [INFO ] Deduced a trap composed of 22 places in 850 ms of which 4 ms to minimize.
[2023-03-23 00:08:28] [INFO ] Deduced a trap composed of 26 places in 1022 ms of which 3 ms to minimize.
[2023-03-23 00:08:29] [INFO ] Deduced a trap composed of 24 places in 881 ms of which 2 ms to minimize.
[2023-03-23 00:08:31] [INFO ] Deduced a trap composed of 35 places in 1032 ms of which 2 ms to minimize.
[2023-03-23 00:08:32] [INFO ] Deduced a trap composed of 32 places in 917 ms of which 1 ms to minimize.
[2023-03-23 00:08:33] [INFO ] Deduced a trap composed of 28 places in 970 ms of which 2 ms to minimize.
[2023-03-23 00:08:34] [INFO ] Deduced a trap composed of 31 places in 894 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 00:08:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:08:34] [INFO ] After 25796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2029 ms.
Support contains 207 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 3123 transition count 2258
Reduce places removed 585 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 587 rules applied. Total rules applied 1172 place count 2538 transition count 2256
Reduce places removed 1 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 2 with 70 rules applied. Total rules applied 1242 place count 2537 transition count 2187
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 1311 place count 2468 transition count 2187
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 170 Pre rules applied. Total rules applied 1311 place count 2468 transition count 2017
Deduced a syphon composed of 170 places in 7 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1651 place count 2298 transition count 2017
Discarding 265 places :
Symmetric choice reduction at 4 with 265 rule applications. Total rules 1916 place count 2033 transition count 1752
Iterating global reduction 4 with 265 rules applied. Total rules applied 2181 place count 2033 transition count 1752
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 2181 place count 2033 transition count 1668
Deduced a syphon composed of 84 places in 13 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2349 place count 1949 transition count 1668
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Deduced a syphon composed of 606 places in 5 ms
Reduce places removed 606 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 3561 place count 1343 transition count 1062
Renaming transitions due to excessive name length > 1024 char.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 3705 place count 1271 transition count 1062
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3713 place count 1271 transition count 1054
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 3721 place count 1263 transition count 1054
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 5 with 97 rules applied. Total rules applied 3818 place count 1263 transition count 1054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3819 place count 1262 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3820 place count 1261 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3820 place count 1261 transition count 1051
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3824 place count 1259 transition count 1051
Applied a total of 3824 rules in 1134 ms. Remains 1259 /3123 variables (removed 1864) and now considering 1051/2843 (removed 1792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1134 ms. Remains : 1259/3123 places, 1051/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 9) seen :3
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1051 rows 1259 cols
[2023-03-23 00:08:38] [INFO ] Computed 440 place invariants in 8 ms
[2023-03-23 00:08:38] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 00:08:39] [INFO ] [Nat]Absence check using 440 positive place invariants in 155 ms returned sat
[2023-03-23 00:08:41] [INFO ] After 1653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 00:08:41] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-23 00:08:42] [INFO ] After 1196ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 00:08:43] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 13 ms to minimize.
[2023-03-23 00:08:43] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2023-03-23 00:08:43] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-23 00:08:44] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 0 ms to minimize.
[2023-03-23 00:08:44] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-23 00:08:44] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-23 00:08:45] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 1 ms to minimize.
[2023-03-23 00:08:45] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-23 00:08:46] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 1 ms to minimize.
[2023-03-23 00:08:46] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-23 00:08:46] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-23 00:08:46] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 13 ms to minimize.
[2023-03-23 00:08:47] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-23 00:08:47] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2023-03-23 00:08:48] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 0 ms to minimize.
[2023-03-23 00:08:48] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2023-03-23 00:08:48] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 1 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6862 ms
[2023-03-23 00:08:50] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-23 00:08:50] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2023-03-23 00:08:50] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-23 00:08:51] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2023-03-23 00:08:51] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 1 ms to minimize.
[2023-03-23 00:08:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1509 ms
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 0 ms to minimize.
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 0 ms to minimize.
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 0 ms to minimize.
[2023-03-23 00:08:53] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 14 ms to minimize.
[2023-03-23 00:08:53] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 1 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 12 places in 313 ms of which 0 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 13 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 14 ms to minimize.
[2023-03-23 00:08:55] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 0 ms to minimize.
[2023-03-23 00:08:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3503 ms
[2023-03-23 00:08:55] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 0 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 14 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2023-03-23 00:08:57] [INFO ] Deduced a trap composed of 14 places in 360 ms of which 0 ms to minimize.
[2023-03-23 00:08:57] [INFO ] Deduced a trap composed of 9 places in 411 ms of which 0 ms to minimize.
[2023-03-23 00:08:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2413 ms
[2023-03-23 00:08:58] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2023-03-23 00:08:59] [INFO ] Deduced a trap composed of 8 places in 343 ms of which 14 ms to minimize.
[2023-03-23 00:08:59] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 0 ms to minimize.
[2023-03-23 00:08:59] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 0 ms to minimize.
[2023-03-23 00:09:00] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2023-03-23 00:09:01] [INFO ] Deduced a trap composed of 14 places in 1018 ms of which 1 ms to minimize.
[2023-03-23 00:09:01] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 1 ms to minimize.
[2023-03-23 00:09:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3329 ms
[2023-03-23 00:09:02] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 1 ms to minimize.
[2023-03-23 00:09:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2023-03-23 00:09:02] [INFO ] After 20881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1341 ms.
[2023-03-23 00:09:03] [INFO ] After 24638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 226 ms.
Support contains 148 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1051/1051 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1259 transition count 1037
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 1245 transition count 1036
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 1244 transition count 1036
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 30 place count 1244 transition count 1018
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 66 place count 1226 transition count 1018
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 1223 transition count 1015
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 1223 transition count 1015
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 112 place count 1203 transition count 995
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 134 place count 1192 transition count 995
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 1192 transition count 994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 1191 transition count 994
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 145 place count 1191 transition count 994
Applied a total of 145 rules in 240 ms. Remains 1191 /1259 variables (removed 68) and now considering 994/1051 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 1191/1259 places, 994/1051 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 65797 steps, run timeout after 3008 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65797 steps, saw 44577 distinct states, run finished after 3011 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 994 rows 1191 cols
[2023-03-23 00:09:07] [INFO ] Computed 440 place invariants in 5 ms
[2023-03-23 00:09:08] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 00:09:08] [INFO ] [Nat]Absence check using 440 positive place invariants in 139 ms returned sat
[2023-03-23 00:09:10] [INFO ] After 1968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 00:09:10] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-23 00:09:11] [INFO ] After 960ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 00:09:12] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 2 ms to minimize.
[2023-03-23 00:09:12] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-23 00:09:12] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 15 ms to minimize.
[2023-03-23 00:09:13] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-23 00:09:13] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2023-03-23 00:09:13] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 25 ms to minimize.
[2023-03-23 00:09:14] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 14 ms to minimize.
[2023-03-23 00:09:14] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 2 ms to minimize.
[2023-03-23 00:09:14] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-23 00:09:15] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 0 ms to minimize.
[2023-03-23 00:09:15] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 1 ms to minimize.
[2023-03-23 00:09:15] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:09:16] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 0 ms to minimize.
[2023-03-23 00:09:16] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-23 00:09:16] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 0 ms to minimize.
[2023-03-23 00:09:16] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2023-03-23 00:09:17] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 2 ms to minimize.
[2023-03-23 00:09:17] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 1 ms to minimize.
[2023-03-23 00:09:17] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 0 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 1 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 0 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7159 ms
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-23 00:09:20] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-03-23 00:09:20] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-23 00:09:20] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2023-03-23 00:09:20] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-23 00:09:21] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-23 00:09:21] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-23 00:09:21] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2023-03-23 00:09:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2276 ms
[2023-03-23 00:09:22] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 1 ms to minimize.
[2023-03-23 00:09:22] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2023-03-23 00:09:22] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-23 00:09:23] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2023-03-23 00:09:23] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 0 ms to minimize.
[2023-03-23 00:09:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1789 ms
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 0 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2202 ms
[2023-03-23 00:09:26] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 0 ms to minimize.
[2023-03-23 00:09:26] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2023-03-23 00:09:27] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2023-03-23 00:09:27] [INFO ] Deduced a trap composed of 9 places in 358 ms of which 1 ms to minimize.
[2023-03-23 00:09:27] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 0 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 2 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 0 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2718 ms
[2023-03-23 00:09:29] [INFO ] After 18180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1368 ms.
[2023-03-23 00:09:30] [INFO ] After 22261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 257 ms.
Support contains 148 out of 1191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1191/1191 places, 994/994 transitions.
Applied a total of 0 rules in 35 ms. Remains 1191 /1191 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1191/1191 places, 994/994 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1191/1191 places, 994/994 transitions.
Applied a total of 0 rules in 34 ms. Remains 1191 /1191 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2023-03-23 00:09:30] [INFO ] Invariant cache hit.
[2023-03-23 00:09:31] [INFO ] Implicit Places using invariants in 749 ms returned [1172, 1176]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 753 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1189/1191 places, 994/994 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1187 transition count 992
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1187 transition count 992
Applied a total of 4 rules in 70 ms. Remains 1187 /1189 variables (removed 2) and now considering 992/994 (removed 2) transitions.
// Phase 1: matrix 992 rows 1187 cols
[2023-03-23 00:09:31] [INFO ] Computed 438 place invariants in 9 ms
[2023-03-23 00:09:32] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-23 00:09:32] [INFO ] Invariant cache hit.
[2023-03-23 00:09:33] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-23 00:09:35] [INFO ] Implicit Places using invariants and state equation in 3557 ms returned []
Implicit Place search using SMT with State Equation took 4432 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1187/1191 places, 992/994 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5289 ms. Remains : 1187/1191 places, 992/994 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 76640 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76640 steps, saw 51266 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 00:09:40] [INFO ] Invariant cache hit.
[2023-03-23 00:09:40] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 00:09:40] [INFO ] [Nat]Absence check using 438 positive place invariants in 125 ms returned sat
[2023-03-23 00:09:42] [INFO ] After 1211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 00:09:42] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-23 00:09:43] [INFO ] After 1086ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 00:09:43] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:09:44] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2023-03-23 00:09:44] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-23 00:09:44] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 0 ms to minimize.
[2023-03-23 00:09:44] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2023-03-23 00:09:45] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:09:45] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 0 ms to minimize.
[2023-03-23 00:09:46] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2023-03-23 00:09:46] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 0 ms to minimize.
[2023-03-23 00:09:46] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 1 ms to minimize.
[2023-03-23 00:09:46] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-23 00:09:47] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-23 00:09:47] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 1 ms to minimize.
[2023-03-23 00:09:47] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2023-03-23 00:09:48] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-23 00:09:48] [INFO ] Deduced a trap composed of 13 places in 570 ms of which 1 ms to minimize.
[2023-03-23 00:09:49] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 1 ms to minimize.
[2023-03-23 00:09:49] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 0 ms to minimize.
[2023-03-23 00:09:49] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 0 ms to minimize.
[2023-03-23 00:09:50] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-23 00:09:50] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-23 00:09:50] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-23 00:09:50] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 0 ms to minimize.
[2023-03-23 00:09:51] [INFO ] Deduced a trap composed of 9 places in 320 ms of which 0 ms to minimize.
[2023-03-23 00:09:51] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 1 ms to minimize.
[2023-03-23 00:09:52] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 1 ms to minimize.
[2023-03-23 00:09:52] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 0 ms to minimize.
[2023-03-23 00:09:52] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8793 ms
[2023-03-23 00:09:52] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2023-03-23 00:09:53] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2023-03-23 00:09:53] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 0 ms to minimize.
[2023-03-23 00:09:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1005 ms
[2023-03-23 00:09:53] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 0 ms to minimize.
[2023-03-23 00:09:54] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 1 ms to minimize.
[2023-03-23 00:09:54] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2023-03-23 00:09:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1010 ms
[2023-03-23 00:09:55] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2023-03-23 00:09:55] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-23 00:09:55] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2023-03-23 00:09:55] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-23 00:09:56] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2023-03-23 00:09:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1299 ms
[2023-03-23 00:09:56] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-23 00:09:56] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2023-03-23 00:09:57] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-23 00:09:57] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-23 00:09:57] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2023-03-23 00:09:57] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2023-03-23 00:09:58] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2023-03-23 00:09:58] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 1 ms to minimize.
[2023-03-23 00:09:58] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
[2023-03-23 00:09:59] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2023-03-23 00:09:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2840 ms
[2023-03-23 00:09:59] [INFO ] After 17218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1292 ms.
[2023-03-23 00:10:00] [INFO ] After 20422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 300 ms.
Support contains 148 out of 1187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1187/1187 places, 992/992 transitions.
Applied a total of 0 rules in 33 ms. Remains 1187 /1187 variables (removed 0) and now considering 992/992 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1187/1187 places, 992/992 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1187/1187 places, 992/992 transitions.
Applied a total of 0 rules in 32 ms. Remains 1187 /1187 variables (removed 0) and now considering 992/992 (removed 0) transitions.
[2023-03-23 00:10:01] [INFO ] Invariant cache hit.
[2023-03-23 00:10:01] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-23 00:10:01] [INFO ] Invariant cache hit.
[2023-03-23 00:10:02] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-23 00:10:04] [INFO ] Implicit Places using invariants and state equation in 2942 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
[2023-03-23 00:10:04] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-23 00:10:04] [INFO ] Invariant cache hit.
[2023-03-23 00:10:05] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4404 ms. Remains : 1187/1187 places, 992/992 transitions.
Partial Free-agglomeration rule applied 167 times.
Drop transitions removed 167 transitions
Iterating global reduction 0 with 167 rules applied. Total rules applied 167 place count 1187 transition count 992
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 169 place count 1187 transition count 990
Applied a total of 169 rules in 150 ms. Remains 1187 /1187 variables (removed 0) and now considering 990/992 (removed 2) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 990 rows 1187 cols
[2023-03-23 00:10:05] [INFO ] Computed 438 place invariants in 8 ms
[2023-03-23 00:10:05] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 00:10:06] [INFO ] [Nat]Absence check using 438 positive place invariants in 161 ms returned sat
[2023-03-23 00:10:07] [INFO ] After 1079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 00:10:07] [INFO ] State equation strengthened by 139 read => feed constraints.
[2023-03-23 00:10:08] [INFO ] After 1178ms SMT Verify possible using 139 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 00:10:09] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 0 ms to minimize.
[2023-03-23 00:10:09] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2023-03-23 00:10:10] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 0 ms to minimize.
[2023-03-23 00:10:10] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 0 ms to minimize.
[2023-03-23 00:10:10] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 1 ms to minimize.
[2023-03-23 00:10:11] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2023-03-23 00:10:11] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 0 ms to minimize.
[2023-03-23 00:10:11] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-23 00:10:12] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-23 00:10:12] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 1 ms to minimize.
[2023-03-23 00:10:13] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 1 ms to minimize.
[2023-03-23 00:10:13] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:10:13] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 1 ms to minimize.
[2023-03-23 00:10:14] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-23 00:10:14] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-23 00:10:14] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 0 ms to minimize.
[2023-03-23 00:10:15] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 0 ms to minimize.
[2023-03-23 00:10:15] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 0 ms to minimize.
[2023-03-23 00:10:15] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 0 ms to minimize.
[2023-03-23 00:10:16] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2023-03-23 00:10:16] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2023-03-23 00:10:17] [INFO ] Deduced a trap composed of 15 places in 461 ms of which 1 ms to minimize.
[2023-03-23 00:10:17] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 1 ms to minimize.
[2023-03-23 00:10:17] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2023-03-23 00:10:18] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 1 ms to minimize.
[2023-03-23 00:10:18] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-23 00:10:19] [INFO ] Deduced a trap composed of 14 places in 545 ms of which 1 ms to minimize.
[2023-03-23 00:10:19] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9896 ms
[2023-03-23 00:10:19] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2023-03-23 00:10:19] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2023-03-23 00:10:20] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 0 ms to minimize.
[2023-03-23 00:10:20] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-23 00:10:20] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-23 00:10:20] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-23 00:10:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1737 ms
[2023-03-23 00:10:21] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-23 00:10:21] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2023-03-23 00:10:21] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:10:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1031 ms
[2023-03-23 00:10:22] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 1 ms to minimize.
[2023-03-23 00:10:23] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2023-03-23 00:10:24] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2023-03-23 00:10:24] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2023-03-23 00:10:24] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 1 ms to minimize.
[2023-03-23 00:10:25] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2023-03-23 00:10:25] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 0 ms to minimize.
[2023-03-23 00:10:25] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-23 00:10:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3580 ms
[2023-03-23 00:10:26] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 0 ms to minimize.
[2023-03-23 00:10:26] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2023-03-23 00:10:26] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 0 ms to minimize.
[2023-03-23 00:10:27] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 1 ms to minimize.
[2023-03-23 00:10:27] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 0 ms to minimize.
[2023-03-23 00:10:27] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2023-03-23 00:10:28] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 0 ms to minimize.
[2023-03-23 00:10:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1934 ms
[2023-03-23 00:10:28] [INFO ] After 20531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1595 ms.
[2023-03-23 00:10:29] [INFO ] After 23986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-23 00:10:29] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-23 00:10:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1187 places, 992 transitions and 4041 arcs took 11 ms.
[2023-03-23 00:10:30] [INFO ] Flatten gal took : 157 ms
Total runtime 145102 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPt_PT_040B
(NrP: 1187 NrTr: 992 NrArc: 4041)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.106sec

net check time: 0m 0.000sec

init dd package: 0m 3.002sec


before gc: list nodes free: 1031325

after gc: idd nodes used:10786, unused:63989214; list nodes free:262090027

before gc: list nodes free: 715538

after gc: idd nodes used:17711, unused:63982289; list nodes free:268349000

before gc: list nodes free: 2055052

after gc: idd nodes used:19742, unused:63980258; list nodes free:268339565

before gc: list nodes free: 117863

after gc: idd nodes used:16046, unused:63983954; list nodes free:268356647

before gc: list nodes free: 1687075

after gc: idd nodes used:24123, unused:63975877; list nodes free:278802890

before gc: list nodes free: 1066581

after gc: idd nodes used:27441, unused:63972559; list nodes free:282983254

before gc: list nodes free: 4464930

after gc: idd nodes used:29056, unused:63970944; list nodes free:282977455

before gc: list nodes free: 2616494

after gc: idd nodes used:38832, unused:63961168; list nodes free:282928656

before gc: list nodes free: 223990

after gc: idd nodes used:43217, unused:63956783; list nodes free:285007653

before gc: list nodes free: 3289512

after gc: idd nodes used:39937, unused:63960063; list nodes free:285024722

before gc: list nodes free: 6299621

after gc: idd nodes used:42191, unused:63957809; list nodes free:285015503

before gc: list nodes free: 2148389

after gc: idd nodes used:51043, unused:63948957; list nodes free:284973603

before gc: list nodes free: 3647005

after gc: idd nodes used:48055, unused:63951945; list nodes free:284988569

before gc: list nodes free: 3996229

after gc: idd nodes used:54197, unused:63945803; list nodes free:284960733

before gc: list nodes free: 4559113

after gc: idd nodes used:52840, unused:63947160; list nodes free:284965945

before gc: list nodes free: 4495375

after gc: idd nodes used:53475, unused:63946525; list nodes free:284963569

before gc: list nodes free: 3637847

after gc: idd nodes used:56873, unused:63943127; list nodes free:284948098

before gc: list nodes free: 5394331

after gc: idd nodes used:54924, unused:63945076; list nodes free:284956047

before gc: list nodes free: 2860873

after gc: idd nodes used:56726, unused:63943274; list nodes free:284949304

before gc: list nodes free: 2622378

after gc: idd nodes used:56658, unused:63943342; list nodes free:284948621

before gc: list nodes free: 4945030

after gc: idd nodes used:55995, unused:63944005; list nodes free:284953805
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6256280 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095748 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.004sec

7485 14077 10747 13439 10417 11642 15054 15660 16249 18048 17719 18862 18121 19114 15827 15467 15470 17424 24197 26218 27128 28069 36641 38433 40454 41311 48669 45329 49628 51536 52543 53224 52805 53615 53648 56099 56273 57610

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldPPPt-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903718200671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;