fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903717800335
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldIIPt-PT-050B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9887.747 414291.00 461207.00 45.40 ????T?F??FF????? normal

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-167903717800335.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 ShieldIIPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 860K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679506122061

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=ShieldIIPt-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:28:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:28:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:28:44] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-22 17:28:44] [INFO ] Transformed 3503 places.
[2023-03-22 17:28:44] [INFO ] Transformed 3253 transitions.
[2023-03-22 17:28:44] [INFO ] Found NUPN structural information;
[2023-03-22 17:28:44] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 16) seen :3
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-22 17:28:45] [INFO ] Computed 451 place invariants in 31 ms
[2023-03-22 17:28:47] [INFO ] [Real]Absence check using 451 positive place invariants in 320 ms returned sat
[2023-03-22 17:28:49] [INFO ] After 4163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 17:28:51] [INFO ] [Nat]Absence check using 451 positive place invariants in 264 ms returned sat
[2023-03-22 17:29:03] [INFO ] After 10866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 17:29:04] [INFO ] Deduced a trap composed of 38 places in 1240 ms of which 16 ms to minimize.
[2023-03-22 17:29:06] [INFO ] Deduced a trap composed of 30 places in 1297 ms of which 2 ms to minimize.
[2023-03-22 17:29:07] [INFO ] Deduced a trap composed of 27 places in 1059 ms of which 2 ms to minimize.
[2023-03-22 17:29:08] [INFO ] Deduced a trap composed of 17 places in 1199 ms of which 2 ms to minimize.
[2023-03-22 17:29:10] [INFO ] Deduced a trap composed of 36 places in 1072 ms of which 3 ms to minimize.
[2023-03-22 17:29:11] [INFO ] Deduced a trap composed of 38 places in 1106 ms of which 2 ms to minimize.
[2023-03-22 17:29:12] [INFO ] Deduced a trap composed of 48 places in 1128 ms of which 15 ms to minimize.
[2023-03-22 17:29:13] [INFO ] Deduced a trap composed of 42 places in 947 ms of which 2 ms to minimize.
[2023-03-22 17:29:14] [INFO ] Deduced a trap composed of 32 places in 991 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-22 17:29:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 17:29:14] [INFO ] After 25322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 1511 ms.
Support contains 118 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 764 transitions
Trivial Post-agglo rules discarded 764 transitions
Performed 764 trivial Post agglomeration. Transition count delta: 764
Iterating post reduction 0 with 764 rules applied. Total rules applied 764 place count 3503 transition count 2489
Reduce places removed 764 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 766 rules applied. Total rules applied 1530 place count 2739 transition count 2487
Reduce places removed 1 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 45 rules applied. Total rules applied 1575 place count 2738 transition count 2443
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1619 place count 2694 transition count 2443
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1619 place count 2694 transition count 2237
Deduced a syphon composed of 206 places in 7 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 2031 place count 2488 transition count 2237
Discarding 316 places :
Symmetric choice reduction at 4 with 316 rule applications. Total rules 2347 place count 2172 transition count 1921
Iterating global reduction 4 with 316 rules applied. Total rules applied 2663 place count 2172 transition count 1921
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 2663 place count 2172 transition count 1796
Deduced a syphon composed of 125 places in 12 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 2913 place count 2047 transition count 1796
Performed 802 Post agglomeration using F-continuation condition.Transition count delta: 802
Deduced a syphon composed of 802 places in 4 ms
Reduce places removed 802 places and 0 transitions.
Iterating global reduction 4 with 1604 rules applied. Total rules applied 4517 place count 1245 transition count 994
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4719 place count 1144 transition count 1044
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 4767 place count 1120 transition count 1058
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4768 place count 1120 transition count 1057
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 4773 place count 1120 transition count 1052
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4778 place count 1115 transition count 1052
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 4824 place count 1115 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4825 place count 1114 transition count 1051
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4827 place count 1112 transition count 1051
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4827 place count 1112 transition count 1050
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4829 place count 1111 transition count 1050
Applied a total of 4829 rules in 1049 ms. Remains 1111 /3503 variables (removed 2392) and now considering 1050/3253 (removed 2203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1049 ms. Remains : 1111/3503 places, 1050/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 76943 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76943 steps, saw 65556 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1050 rows 1111 cols
[2023-03-22 17:29:22] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-22 17:29:22] [INFO ] [Real]Absence check using 449 positive place invariants in 172 ms returned sat
[2023-03-22 17:29:23] [INFO ] After 1098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 17:29:23] [INFO ] [Nat]Absence check using 449 positive place invariants in 128 ms returned sat
[2023-03-22 17:29:25] [INFO ] After 1678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 17:29:25] [INFO ] State equation strengthened by 334 read => feed constraints.
[2023-03-22 17:29:28] [INFO ] After 3133ms SMT Verify possible using 334 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-22 17:29:29] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-22 17:29:29] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-22 17:29:29] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 2 ms to minimize.
[2023-03-22 17:29:30] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-22 17:29:30] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-22 17:29:30] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-22 17:29:30] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 17:29:30] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-22 17:29:30] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-22 17:29:30] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-22 17:29:31] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2023-03-22 17:29:31] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-22 17:29:31] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 6 ms to minimize.
[2023-03-22 17:29:31] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2023-03-22 17:29:31] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-22 17:29:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2766 ms
[2023-03-22 17:29:33] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2023-03-22 17:29:33] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-22 17:29:33] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-22 17:29:33] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2023-03-22 17:29:33] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-22 17:29:34] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-22 17:29:34] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-22 17:29:34] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-22 17:29:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1501 ms
[2023-03-22 17:29:35] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2023-03-22 17:29:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-22 17:29:36] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-22 17:29:36] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-22 17:29:36] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-22 17:29:36] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-22 17:29:37] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-22 17:29:37] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2023-03-22 17:29:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 982 ms
[2023-03-22 17:29:37] [INFO ] After 11716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 5340 ms.
[2023-03-22 17:29:42] [INFO ] After 19682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 643 ms.
Support contains 118 out of 1111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1050/1050 transitions.
Applied a total of 0 rules in 33 ms. Remains 1111 /1111 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1111/1111 places, 1050/1050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1050/1050 transitions.
Applied a total of 0 rules in 28 ms. Remains 1111 /1111 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
[2023-03-22 17:29:43] [INFO ] Invariant cache hit.
[2023-03-22 17:29:44] [INFO ] Implicit Places using invariants in 540 ms returned [1099]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 543 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1110/1111 places, 1050/1050 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1109 transition count 1049
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1109 transition count 1049
Applied a total of 2 rules in 108 ms. Remains 1109 /1110 variables (removed 1) and now considering 1049/1050 (removed 1) transitions.
// Phase 1: matrix 1049 rows 1109 cols
[2023-03-22 17:29:44] [INFO ] Computed 448 place invariants in 17 ms
[2023-03-22 17:29:44] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-22 17:29:44] [INFO ] Invariant cache hit.
[2023-03-22 17:29:45] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-22 17:29:48] [INFO ] Implicit Places using invariants and state equation in 4172 ms returned []
Implicit Place search using SMT with State Equation took 4706 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1109/1111 places, 1049/1050 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5386 ms. Remains : 1109/1111 places, 1049/1050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 13) seen :1
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 78294 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78294 steps, saw 60825 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-22 17:29:53] [INFO ] Invariant cache hit.
[2023-03-22 17:29:53] [INFO ] [Real]Absence check using 448 positive place invariants in 71 ms returned sat
[2023-03-22 17:29:54] [INFO ] After 405ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-22 17:29:54] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-22 17:29:54] [INFO ] After 143ms SMT Verify possible using 333 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:29:54] [INFO ] After 952ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:29:54] [INFO ] [Nat]Absence check using 448 positive place invariants in 113 ms returned sat
[2023-03-22 17:29:57] [INFO ] After 1856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 17:29:59] [INFO ] After 2744ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-22 17:30:00] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2023-03-22 17:30:00] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-22 17:30:00] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-22 17:30:00] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-22 17:30:01] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-22 17:30:01] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-22 17:30:01] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-22 17:30:01] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-22 17:30:01] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-22 17:30:02] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-22 17:30:02] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-22 17:30:02] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-22 17:30:02] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-22 17:30:02] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-22 17:30:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3040 ms
[2023-03-22 17:30:04] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2023-03-22 17:30:05] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2023-03-22 17:30:05] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-22 17:30:05] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2023-03-22 17:30:05] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2023-03-22 17:30:05] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-22 17:30:06] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-22 17:30:06] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-22 17:30:06] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-22 17:30:06] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2023-03-22 17:30:07] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-22 17:30:07] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2023-03-22 17:30:07] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-22 17:30:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3110 ms
[2023-03-22 17:30:08] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 3 ms to minimize.
[2023-03-22 17:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-22 17:30:09] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-22 17:30:09] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-22 17:30:09] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-22 17:30:09] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 17:30:09] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-22 17:30:10] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-22 17:30:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1294 ms
[2023-03-22 17:30:10] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-22 17:30:11] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-22 17:30:12] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2023-03-22 17:30:12] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 0 ms to minimize.
[2023-03-22 17:30:12] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-22 17:30:12] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2023-03-22 17:30:13] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-22 17:30:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2682 ms
[2023-03-22 17:30:13] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-22 17:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-22 17:30:13] [INFO ] After 16606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 5305 ms.
[2023-03-22 17:30:19] [INFO ] After 24686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 617 ms.
Support contains 116 out of 1109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1109/1109 places, 1049/1049 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1109 transition count 1048
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1108 transition count 1048
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1106 transition count 1046
Applied a total of 6 rules in 57 ms. Remains 1106 /1109 variables (removed 3) and now considering 1046/1049 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1106/1109 places, 1046/1049 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) seen :0
Interrupted probabilistic random walk after 85302 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85302 steps, saw 65679 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1046 rows 1106 cols
[2023-03-22 17:30:24] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-22 17:30:24] [INFO ] [Real]Absence check using 448 positive place invariants in 92 ms returned sat
[2023-03-22 17:30:24] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:30:25] [INFO ] [Nat]Absence check using 448 positive place invariants in 135 ms returned sat
[2023-03-22 17:30:26] [INFO ] After 1503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 17:30:26] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-22 17:30:29] [INFO ] After 2367ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-22 17:30:29] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 2 ms to minimize.
[2023-03-22 17:30:29] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2023-03-22 17:30:30] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-22 17:30:30] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-22 17:30:30] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-22 17:30:30] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-22 17:30:31] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2023-03-22 17:30:31] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2023-03-22 17:30:31] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-22 17:30:31] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2023-03-22 17:30:31] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-22 17:30:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2573 ms
[2023-03-22 17:30:34] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-22 17:30:35] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2023-03-22 17:30:35] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-22 17:30:35] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-22 17:30:36] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2023-03-22 17:30:36] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-22 17:30:36] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-22 17:30:36] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-22 17:30:36] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2023-03-22 17:30:37] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-22 17:30:37] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-22 17:30:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3453 ms
[2023-03-22 17:30:37] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-22 17:30:37] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2023-03-22 17:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2023-03-22 17:30:39] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-22 17:30:39] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-22 17:30:39] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-22 17:30:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 668 ms
[2023-03-22 17:30:39] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-22 17:30:40] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-22 17:30:40] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-22 17:30:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 722 ms
[2023-03-22 17:30:40] [INFO ] After 13904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1732 ms.
[2023-03-22 17:30:42] [INFO ] After 18042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 588 ms.
Support contains 116 out of 1106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 1046/1046 transitions.
Applied a total of 0 rules in 26 ms. Remains 1106 /1106 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1106/1106 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 1046/1046 transitions.
Applied a total of 0 rules in 32 ms. Remains 1106 /1106 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-22 17:30:43] [INFO ] Invariant cache hit.
[2023-03-22 17:30:43] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-22 17:30:43] [INFO ] Invariant cache hit.
[2023-03-22 17:30:44] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-22 17:30:48] [INFO ] Implicit Places using invariants and state equation in 4173 ms returned []
Implicit Place search using SMT with State Equation took 4807 ms to find 0 implicit places.
[2023-03-22 17:30:48] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 17:30:48] [INFO ] Invariant cache hit.
[2023-03-22 17:30:48] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5463 ms. Remains : 1106/1106 places, 1046/1046 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1106 transition count 1045
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 176 place count 1106 transition count 1045
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 177 place count 1106 transition count 1044
Applied a total of 177 rules in 86 ms. Remains 1106 /1106 variables (removed 0) and now considering 1044/1046 (removed 2) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 1044 rows 1106 cols
[2023-03-22 17:30:48] [INFO ] Computed 448 place invariants in 8 ms
[2023-03-22 17:30:49] [INFO ] [Real]Absence check using 448 positive place invariants in 131 ms returned sat
[2023-03-22 17:30:49] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:30:49] [INFO ] [Nat]Absence check using 448 positive place invariants in 115 ms returned sat
[2023-03-22 17:30:51] [INFO ] After 1709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 17:30:51] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-03-22 17:30:53] [INFO ] After 1605ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-22 17:30:53] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-22 17:30:53] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-22 17:30:54] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2023-03-22 17:30:54] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 0 ms to minimize.
[2023-03-22 17:30:54] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-22 17:30:54] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2023-03-22 17:30:55] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2023-03-22 17:30:55] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2023-03-22 17:30:55] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-22 17:30:55] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-22 17:30:56] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-22 17:30:56] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-22 17:30:56] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-22 17:30:56] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-22 17:30:56] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-22 17:30:56] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2023-03-22 17:30:56] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3462 ms
[2023-03-22 17:30:57] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-22 17:30:57] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2023-03-22 17:30:57] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-22 17:30:58] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-22 17:30:58] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2023-03-22 17:30:58] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-22 17:30:58] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-22 17:30:58] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-22 17:30:59] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-22 17:30:59] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-22 17:30:59] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-22 17:30:59] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 13 ms to minimize.
[2023-03-22 17:30:59] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-22 17:31:00] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2023-03-22 17:31:00] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-22 17:31:00] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-22 17:31:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3297 ms
[2023-03-22 17:31:01] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-22 17:31:01] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-22 17:31:02] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-22 17:31:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 659 ms
[2023-03-22 17:31:02] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-22 17:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-22 17:31:02] [INFO ] After 11069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1732 ms.
[2023-03-22 17:31:04] [INFO ] After 15436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
[2023-03-22 17:31:04] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-22 17:31:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1106 places, 1046 transitions and 4942 arcs took 11 ms.
[2023-03-22 17:31:05] [INFO ] Flatten gal took : 142 ms
Total runtime 141160 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: ShieldIIPt_PT_050B
(NrP: 1106 NrTr: 1046 NrArc: 4942)

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

net check time: 0m 0.000sec

init dd package: 0m 2.849sec


before gc: list nodes free: 334262

after gc: idd nodes used:56915050, unused:7084950; list nodes free:29906502

RS generation: 4m 4.019sec


-> last computed set: #nodes 56913946 (5.7e+07) #states 7,593,266 (6)


CANNOT_COMPUTE


BK_STOP 1679506536352

--------------------
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.005sec

idd.cc:820: DD Exception: No free nodes

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="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 ShieldIIPt-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717800335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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