About the Execution of 2023-gold for ShieldIIPt-PT-020B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
533.903 | 75344.00 | 95374.00 | 616.70 | FTTTTTTTTTFFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788700180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 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-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716952976308
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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 03:22:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 03:22:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:22:58] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-29 03:22:58] [INFO ] Transformed 1403 places.
[2024-05-29 03:22:58] [INFO ] Transformed 1303 transitions.
[2024-05-29 03:22:58] [INFO ] Found NUPN structural information;
[2024-05-29 03:22:58] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2024-05-29 03:22:59] [INFO ] Computed 181 invariants in 37 ms
[2024-05-29 03:23:00] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 03:23:00] [INFO ] [Nat]Absence check using 181 positive place invariants in 62 ms returned sat
[2024-05-29 03:23:12] [INFO ] After 11305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 03:23:12] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 7 ms to minimize.
[2024-05-29 03:23:13] [INFO ] Deduced a trap composed of 25 places in 330 ms of which 2 ms to minimize.
[2024-05-29 03:23:13] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 1 ms to minimize.
[2024-05-29 03:23:14] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 4 ms to minimize.
[2024-05-29 03:23:14] [INFO ] Deduced a trap composed of 24 places in 367 ms of which 1 ms to minimize.
[2024-05-29 03:23:15] [INFO ] Deduced a trap composed of 34 places in 334 ms of which 1 ms to minimize.
[2024-05-29 03:23:15] [INFO ] Deduced a trap composed of 26 places in 400 ms of which 1 ms to minimize.
[2024-05-29 03:23:16] [INFO ] Deduced a trap composed of 30 places in 332 ms of which 1 ms to minimize.
[2024-05-29 03:23:16] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 1 ms to minimize.
[2024-05-29 03:23:16] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 1 ms to minimize.
[2024-05-29 03:23:17] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 0 ms to minimize.
[2024-05-29 03:23:17] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 1 ms to minimize.
[2024-05-29 03:23:17] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 1 ms to minimize.
[2024-05-29 03:23:18] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 1 ms to minimize.
[2024-05-29 03:23:18] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 0 ms to minimize.
[2024-05-29 03:23:18] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 1 ms to minimize.
[2024-05-29 03:23:19] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 1 ms to minimize.
[2024-05-29 03:23:19] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 0 ms to minimize.
[2024-05-29 03:23:19] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 1 ms to minimize.
[2024-05-29 03:23:20] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 1 ms to minimize.
[2024-05-29 03:23:20] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 1 ms to minimize.
[2024-05-29 03:23:21] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 1 ms to minimize.
[2024-05-29 03:23:21] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2024-05-29 03:23:21] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 1 ms to minimize.
[2024-05-29 03:23:22] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2024-05-29 03:23:22] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 1 ms to minimize.
[2024-05-29 03:23:22] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 1 ms to minimize.
[2024-05-29 03:23:22] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 1 ms to minimize.
[2024-05-29 03:23:23] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 1 ms to minimize.
[2024-05-29 03:23:23] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 1 ms to minimize.
[2024-05-29 03:23:23] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 0 ms to minimize.
[2024-05-29 03:23:24] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 1 ms to minimize.
[2024-05-29 03:23:24] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2024-05-29 03:23:25] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 0 ms to minimize.
[2024-05-29 03:23:25] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 0 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 03:23:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 03:23:25] [INFO ] After 25264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 422 ms.
Support contains 213 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1403 transition count 1107
Reduce places removed 196 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 1 with 251 rules applied. Total rules applied 447 place count 1207 transition count 1052
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 503 place count 1152 transition count 1051
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 503 place count 1152 transition count 970
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 665 place count 1071 transition count 970
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 762 place count 974 transition count 873
Iterating global reduction 3 with 97 rules applied. Total rules applied 859 place count 974 transition count 873
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 859 place count 974 transition count 850
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 905 place count 951 transition count 850
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1409 place count 699 transition count 598
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1461 place count 673 transition count 602
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1467 place count 673 transition count 596
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1473 place count 667 transition count 596
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 1491 place count 667 transition count 596
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1492 place count 666 transition count 595
Applied a total of 1492 rules in 446 ms. Remains 666 /1403 variables (removed 737) and now considering 595/1303 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 666/1403 places, 595/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 595 rows 666 cols
[2024-05-29 03:23:26] [INFO ] Computed 181 invariants in 14 ms
[2024-05-29 03:23:27] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 03:23:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 43 ms returned sat
[2024-05-29 03:23:28] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 03:23:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-29 03:23:28] [INFO ] After 590ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 03:23:29] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2024-05-29 03:23:29] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2024-05-29 03:23:29] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-29 03:23:29] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2024-05-29 03:23:29] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2024-05-29 03:23:29] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-05-29 03:23:29] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2024-05-29 03:23:30] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 03:23:30] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2024-05-29 03:23:30] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-29 03:23:30] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-29 03:23:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1513 ms
[2024-05-29 03:23:30] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 03:23:30] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-29 03:23:31] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2024-05-29 03:23:31] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2024-05-29 03:23:31] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-29 03:23:31] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-29 03:23:31] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 03:23:31] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 03:23:31] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-29 03:23:32] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 8 ms to minimize.
[2024-05-29 03:23:32] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 03:23:32] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 03:23:32] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-29 03:23:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1843 ms
[2024-05-29 03:23:32] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2024-05-29 03:23:32] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 03:23:33] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2024-05-29 03:23:33] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2024-05-29 03:23:33] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2024-05-29 03:23:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 853 ms
[2024-05-29 03:23:33] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 03:23:33] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 4 ms to minimize.
[2024-05-29 03:23:33] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2024-05-29 03:23:34] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-29 03:23:34] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 03:23:34] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 3 ms to minimize.
[2024-05-29 03:23:34] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-29 03:23:34] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2024-05-29 03:23:34] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2024-05-29 03:23:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1276 ms
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 03:23:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 577 ms
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 03:23:35] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1025 ms
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-05-29 03:23:36] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-29 03:23:37] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 03:23:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 470 ms
[2024-05-29 03:23:37] [INFO ] After 8936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 874 ms.
[2024-05-29 03:23:38] [INFO ] After 10842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 134 ms.
Support contains 195 out of 666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 595/595 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 666 transition count 593
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 664 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 663 transition count 592
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 663 transition count 589
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 660 transition count 589
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 40 place count 646 transition count 575
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 645 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 644 transition count 575
Applied a total of 43 rules in 108 ms. Remains 644 /666 variables (removed 22) and now considering 575/595 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 644/666 places, 575/595 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) 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 7) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 575 rows 644 cols
[2024-05-29 03:23:38] [INFO ] Computed 181 invariants in 8 ms
[2024-05-29 03:23:39] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 03:23:39] [INFO ] [Nat]Absence check using 181 positive place invariants in 36 ms returned sat
[2024-05-29 03:23:40] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 03:23:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 03:23:40] [INFO ] After 716ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-29 03:23:41] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 03:23:42] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-29 03:23:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1081 ms
[2024-05-29 03:23:42] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2024-05-29 03:23:42] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-29 03:23:42] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2024-05-29 03:23:42] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 03:23:42] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-29 03:23:43] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-29 03:23:44] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 3 ms to minimize.
[2024-05-29 03:23:44] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 03:23:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1916 ms
[2024-05-29 03:23:44] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 03:23:44] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2024-05-29 03:23:44] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2024-05-29 03:23:44] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-29 03:23:44] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 985 ms
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-29 03:23:45] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 03:23:46] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 03:23:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 700 ms
[2024-05-29 03:23:46] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2024-05-29 03:23:46] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2024-05-29 03:23:46] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2024-05-29 03:23:46] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2024-05-29 03:23:47] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 03:23:47] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2024-05-29 03:23:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1043 ms
[2024-05-29 03:23:47] [INFO ] After 7082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 925 ms.
[2024-05-29 03:23:48] [INFO ] After 9111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 70 ms.
Support contains 180 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 575/575 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 644 transition count 571
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 640 transition count 571
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 30 place count 629 transition count 560
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 626 transition count 562
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 626 transition count 560
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 624 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 623 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 622 transition count 559
Applied a total of 42 rules in 93 ms. Remains 622 /644 variables (removed 22) and now considering 559/575 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 622/644 places, 559/575 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 185572 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185572 steps, saw 91005 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 559 rows 622 cols
[2024-05-29 03:23:51] [INFO ] Computed 180 invariants in 5 ms
[2024-05-29 03:23:51] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 03:23:52] [INFO ] [Nat]Absence check using 180 positive place invariants in 36 ms returned sat
[2024-05-29 03:23:52] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 03:23:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 03:23:53] [INFO ] After 818ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 03:23:53] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 0 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2024-05-29 03:23:54] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2024-05-29 03:23:55] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-29 03:23:55] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 03:23:55] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2024-05-29 03:23:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1488 ms
[2024-05-29 03:23:55] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2024-05-29 03:23:55] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 03:23:55] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 03:23:55] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 03:23:56] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1903 ms
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 03:23:57] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1174 ms
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 03:23:58] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 03:23:59] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 03:23:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 425 ms
[2024-05-29 03:23:59] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-29 03:23:59] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 03:23:59] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 03:23:59] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 03:23:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 439 ms
[2024-05-29 03:23:59] [INFO ] After 6844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 909 ms.
[2024-05-29 03:24:00] [INFO ] After 8671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 80 ms.
Support contains 180 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 559/559 transitions.
Applied a total of 0 rules in 13 ms. Remains 622 /622 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 622/622 places, 559/559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 559/559 transitions.
Applied a total of 0 rules in 13 ms. Remains 622 /622 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2024-05-29 03:24:00] [INFO ] Invariant cache hit.
[2024-05-29 03:24:01] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 03:24:01] [INFO ] Invariant cache hit.
[2024-05-29 03:24:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 03:24:01] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2024-05-29 03:24:01] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-29 03:24:01] [INFO ] Invariant cache hit.
[2024-05-29 03:24:02] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1434 ms. Remains : 622/622 places, 559/559 transitions.
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 622 transition count 559
Applied a total of 22 rules in 25 ms. Remains 622 /622 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 559 rows 622 cols
[2024-05-29 03:24:02] [INFO ] Computed 180 invariants in 4 ms
[2024-05-29 03:24:02] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 03:24:02] [INFO ] [Nat]Absence check using 180 positive place invariants in 35 ms returned sat
[2024-05-29 03:24:03] [INFO ] After 753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 03:24:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-29 03:24:03] [INFO ] After 530ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-29 03:24:04] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1377 ms
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 03:24:05] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1261 ms
[2024-05-29 03:24:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 03:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 582 ms
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 03:24:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2024-05-29 03:24:08] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 03:24:08] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-29 03:24:08] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:24:08] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 03:24:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 662 ms
[2024-05-29 03:24:08] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 03:24:08] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-05-29 03:24:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2024-05-29 03:24:08] [INFO ] After 5173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 662 ms.
[2024-05-29 03:24:09] [INFO ] After 6820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-29 03:24:09] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-29 03:24:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 622 places, 559 transitions and 1992 arcs took 3 ms.
[2024-05-29 03:24:09] [INFO ] Flatten gal took : 73 ms
Total runtime 71239 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityFireability
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716953051652
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 25 (type EXCL) for 6 ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 20 (type FNDP) for 15 ShieldIIPt-PT-020B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 15 ShieldIIPt-PT-020B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 15 ShieldIIPt-PT-020B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 27 (type SRCH) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-15
lola: result : true
lola: markings : 80
lola: fired transitions : 79
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 20 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 31 (type FNDP) for 9 ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 9 ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 36 (type SRCH) for 9 ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/370/ReachabilityFireability-22.sara.
sara: try reading problem file /home/mcc/execution/370/ReachabilityFireability-34.sara.
lola: FINISHED task # 31 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
lola: result : true
lola: fired transitions : 4775
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 34 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 36 (type SRCH) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-08 (obsolete)
lola: LAUNCH task # 42 (type FNDP) for 0 ShieldIIPt-PT-020B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type EQUN) for 0 ShieldIIPt-PT-020B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type SRCH) for 0 ShieldIIPt-PT-020B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 34 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 42 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-00
lola: result : true
lola: fired transitions : 54
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 44 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 46 (type SRCH) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-00 (obsolete)
lola: LAUNCH task # 49 (type FNDP) for 3 ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 3 ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 3 ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 52 (type SRCH) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
lola: result : true
lola: markings : 3295
lola: fired transitions : 5263
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 49 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 50 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-04 (obsolete)
lola: LAUNCH task # 30 (type FNDP) for 12 ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 12 ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type SRCH) for 12 ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 49 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
lola: result : unknown
lola: fired transitions : 12654
lola: tried executions : 571
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 40 (type SRCH) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
lola: result : true
lola: markings : 932
lola: fired transitions : 961
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 30 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-09 (obsolete)
lola: CANCELED task # 32 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-09 (obsolete)
lola: LAUNCH task # 18 (type FNDP) for 6 ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 6 ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 6 ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 24 (type SRCH) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
lola: result : true
lola: markings : 45
lola: fired transitions : 44
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 19 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldIIPt-PT-020B-ReachabilityFireability-2024-05 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-020B-ReachabilityFireability-2024-00: AG false findpath
ShieldIIPt-PT-020B-ReachabilityFireability-2024-04: EF true tandem / insertion
ShieldIIPt-PT-020B-ReachabilityFireability-2024-05: EF true tandem / insertion
ShieldIIPt-PT-020B-ReachabilityFireability-2024-08: EF true findpath
ShieldIIPt-PT-020B-ReachabilityFireability-2024-09: EF true tandem / insertion
ShieldIIPt-PT-020B-ReachabilityFireability-2024-15: EF true tandem / insertion
Time elapsed: 1 secs. Pages in use: 2
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-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-020B, 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 r373-tall-171683788700180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B 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 '
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 ;