Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 675K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679267497526

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:11:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:11:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:11:40] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-19 23:11:40] [INFO ] Transformed 2403 places.
[2023-03-19 23:11:40] [INFO ] Transformed 2363 transitions.
[2023-03-19 23:11:40] [INFO ] Found NUPN structural information;
[2023-03-19 23:11:40] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 16) seen :8
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 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 39 ms. (steps per millisecond=256 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2023-03-19 23:11:41] [INFO ] Computed 361 place invariants in 34 ms
[2023-03-19 23:11:42] [INFO ] After 1109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 23:11:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 232 ms returned sat
[2023-03-19 23:11:49] [INFO ] After 5138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 23:11:51] [INFO ] Deduced a trap composed of 27 places in 929 ms of which 25 ms to minimize.
[2023-03-19 23:11:52] [INFO ] Deduced a trap composed of 15 places in 658 ms of which 1 ms to minimize.
[2023-03-19 23:11:53] [INFO ] Deduced a trap composed of 24 places in 738 ms of which 41 ms to minimize.
[2023-03-19 23:11:54] [INFO ] Deduced a trap composed of 19 places in 646 ms of which 2 ms to minimize.
[2023-03-19 23:11:54] [INFO ] Deduced a trap composed of 18 places in 700 ms of which 2 ms to minimize.
[2023-03-19 23:11:55] [INFO ] Deduced a trap composed of 12 places in 768 ms of which 2 ms to minimize.
[2023-03-19 23:11:56] [INFO ] Deduced a trap composed of 13 places in 650 ms of which 2 ms to minimize.
[2023-03-19 23:11:57] [INFO ] Deduced a trap composed of 21 places in 679 ms of which 1 ms to minimize.
[2023-03-19 23:11:58] [INFO ] Deduced a trap composed of 37 places in 687 ms of which 4 ms to minimize.
[2023-03-19 23:11:59] [INFO ] Deduced a trap composed of 19 places in 657 ms of which 1 ms to minimize.
[2023-03-19 23:12:01] [INFO ] Deduced a trap composed of 19 places in 759 ms of which 1 ms to minimize.
[2023-03-19 23:12:02] [INFO ] Deduced a trap composed of 20 places in 688 ms of which 1 ms to minimize.
[2023-03-19 23:12:03] [INFO ] Deduced a trap composed of 19 places in 800 ms of which 7 ms to minimize.
[2023-03-19 23:12:05] [INFO ] Deduced a trap composed of 26 places in 876 ms of which 2 ms to minimize.
[2023-03-19 23:12:06] [INFO ] Deduced a trap composed of 34 places in 860 ms of which 2 ms to minimize.
[2023-03-19 23:12:07] [INFO ] Deduced a trap composed of 19 places in 867 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:12:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:12:07] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 656 ms.
Support contains 178 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2403 transition count 2194
Reduce places removed 169 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 178 rules applied. Total rules applied 347 place count 2234 transition count 2185
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 356 place count 2225 transition count 2185
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 193 Pre rules applied. Total rules applied 356 place count 2225 transition count 1992
Deduced a syphon composed of 193 places in 4 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 3 with 386 rules applied. Total rules applied 742 place count 2032 transition count 1992
Discarding 244 places :
Symmetric choice reduction at 3 with 244 rule applications. Total rules 986 place count 1788 transition count 1748
Iterating global reduction 3 with 244 rules applied. Total rules applied 1230 place count 1788 transition count 1748
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 1230 place count 1788 transition count 1671
Deduced a syphon composed of 77 places in 5 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 1384 place count 1711 transition count 1671
Performed 532 Post agglomeration using F-continuation condition.Transition count delta: 532
Deduced a syphon composed of 532 places in 7 ms
Reduce places removed 532 places and 0 transitions.
Iterating global reduction 3 with 1064 rules applied. Total rules applied 2448 place count 1179 transition count 1139
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 3 with 237 rules applied. Total rules applied 2685 place count 1179 transition count 1139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2686 place count 1178 transition count 1138
Applied a total of 2686 rules in 637 ms. Remains 1178 /2403 variables (removed 1225) and now considering 1138/2363 (removed 1225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 1178/2403 places, 1138/2363 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 8) seen :5
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1138 rows 1178 cols
[2023-03-19 23:12:09] [INFO ] Computed 361 place invariants in 46 ms
[2023-03-19 23:12:09] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:12:09] [INFO ] [Nat]Absence check using 350 positive place invariants in 64 ms returned sat
[2023-03-19 23:12:10] [INFO ] [Nat]Absence check using 350 positive and 11 generalized place invariants in 79 ms returned sat
[2023-03-19 23:12:11] [INFO ] After 1383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:12:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:12:12] [INFO ] After 627ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 23:12:12] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 0 ms to minimize.
[2023-03-19 23:12:12] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 3 ms to minimize.
[2023-03-19 23:12:13] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2023-03-19 23:12:13] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 1 ms to minimize.
[2023-03-19 23:12:13] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 1 ms to minimize.
[2023-03-19 23:12:14] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 0 ms to minimize.
[2023-03-19 23:12:14] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 1 ms to minimize.
[2023-03-19 23:12:14] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-19 23:12:15] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:12:15] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-19 23:12:15] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 1 ms to minimize.
[2023-03-19 23:12:15] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-19 23:12:16] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-19 23:12:16] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2023-03-19 23:12:16] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 0 ms to minimize.
[2023-03-19 23:12:16] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-19 23:12:17] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2023-03-19 23:12:17] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 1 ms to minimize.
[2023-03-19 23:12:17] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-19 23:12:18] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 1 ms to minimize.
[2023-03-19 23:12:18] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2023-03-19 23:12:18] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 1 ms to minimize.
[2023-03-19 23:12:19] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 0 ms to minimize.
[2023-03-19 23:12:19] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-19 23:12:19] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 1 ms to minimize.
[2023-03-19 23:12:20] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2023-03-19 23:12:20] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:12:20] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2023-03-19 23:12:20] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-19 23:12:21] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 1 ms to minimize.
[2023-03-19 23:12:21] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 0 ms to minimize.
[2023-03-19 23:12:21] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 1 ms to minimize.
[2023-03-19 23:12:22] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-19 23:12:22] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 1 ms to minimize.
[2023-03-19 23:12:22] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 2 ms to minimize.
[2023-03-19 23:12:23] [INFO ] Deduced a trap composed of 7 places in 455 ms of which 1 ms to minimize.
[2023-03-19 23:12:23] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 1 ms to minimize.
[2023-03-19 23:12:23] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2023-03-19 23:12:23] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2023-03-19 23:12:24] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-19 23:12:24] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 1 ms to minimize.
[2023-03-19 23:12:24] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 0 ms to minimize.
[2023-03-19 23:12:25] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 3 ms to minimize.
[2023-03-19 23:12:25] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2023-03-19 23:12:25] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2023-03-19 23:12:25] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-19 23:12:26] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 1 ms to minimize.
[2023-03-19 23:12:26] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 13 ms to minimize.
[2023-03-19 23:12:26] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2023-03-19 23:12:26] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2023-03-19 23:12:27] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2023-03-19 23:12:27] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 6 ms to minimize.
[2023-03-19 23:12:27] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2023-03-19 23:12:27] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-19 23:12:28] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2023-03-19 23:12:28] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-03-19 23:12:28] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 16200 ms
[2023-03-19 23:12:28] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2023-03-19 23:12:29] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:12:29] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-19 23:12:29] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:12:30] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2023-03-19 23:12:30] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2023-03-19 23:12:30] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:12:31] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-19 23:12:31] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2023-03-19 23:12:31] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-19 23:12:31] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 0 ms to minimize.
[2023-03-19 23:12:32] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2023-03-19 23:12:32] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:12:32] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-19 23:12:32] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2023-03-19 23:12:33] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2023-03-19 23:12:33] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:12:33] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 0 ms to minimize.
[2023-03-19 23:12:33] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2023-03-19 23:12:34] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:12:34] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2023-03-19 23:12:34] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2023-03-19 23:12:35] [INFO ] Deduced a trap composed of 2 places in 531 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:12:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:12:35] [INFO ] After 25545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 96 ms.
Support contains 119 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 1138/1138 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1178 transition count 1134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1174 transition count 1134
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 1174 transition count 1124
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 1164 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1163 transition count 1123
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1163 transition count 1123
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 130 place count 1113 transition count 1073
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 144 place count 1113 transition count 1073
Applied a total of 144 rules in 210 ms. Remains 1113 /1178 variables (removed 65) and now considering 1073/1138 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 1113/1178 places, 1073/1138 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 119469 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119469 steps, saw 72185 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1073 rows 1113 cols
[2023-03-19 23:12:38] [INFO ] Computed 361 place invariants in 30 ms
[2023-03-19 23:12:39] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:12:39] [INFO ] [Nat]Absence check using 355 positive place invariants in 75 ms returned sat
[2023-03-19 23:12:39] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 23:12:40] [INFO ] After 1079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:12:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:12:41] [INFO ] After 628ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 23:12:41] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-19 23:12:42] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 1 ms to minimize.
[2023-03-19 23:12:42] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:12:42] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2023-03-19 23:12:42] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 0 ms to minimize.
[2023-03-19 23:12:43] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-19 23:12:43] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-19 23:12:43] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 0 ms to minimize.
[2023-03-19 23:12:43] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2023-03-19 23:12:44] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-19 23:12:44] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-19 23:12:44] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-19 23:12:45] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-19 23:12:45] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:12:45] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-19 23:12:45] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:12:46] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-19 23:12:46] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2023-03-19 23:12:46] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2023-03-19 23:12:47] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-19 23:12:47] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 1 ms to minimize.
[2023-03-19 23:12:47] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 0 ms to minimize.
[2023-03-19 23:12:47] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-19 23:12:47] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:12:48] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-19 23:12:48] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-19 23:12:48] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-19 23:12:48] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 13 ms to minimize.
[2023-03-19 23:12:48] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2023-03-19 23:12:49] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-19 23:12:49] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2023-03-19 23:12:49] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-19 23:12:49] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-19 23:12:50] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2023-03-19 23:12:50] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-19 23:12:50] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2023-03-19 23:12:50] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9205 ms
[2023-03-19 23:12:51] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-19 23:12:51] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-19 23:12:51] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2023-03-19 23:12:52] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-19 23:12:52] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2023-03-19 23:12:52] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:12:52] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:12:53] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-19 23:12:53] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 0 ms to minimize.
[2023-03-19 23:12:53] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-19 23:12:54] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 9 ms to minimize.
[2023-03-19 23:12:54] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2023-03-19 23:12:54] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2023-03-19 23:12:54] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 0 ms to minimize.
[2023-03-19 23:12:55] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 0 ms to minimize.
[2023-03-19 23:12:55] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2023-03-19 23:12:55] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-19 23:12:55] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-19 23:12:55] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-19 23:12:56] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2023-03-19 23:12:56] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:12:56] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 0 ms to minimize.
[2023-03-19 23:12:56] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-19 23:12:56] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6013 ms
[2023-03-19 23:12:57] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-19 23:12:58] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-19 23:12:58] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2023-03-19 23:12:58] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-19 23:12:58] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2023-03-19 23:12:59] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:12:59] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2023-03-19 23:12:59] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-19 23:12:59] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-19 23:13:00] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:13:00] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-19 23:13:00] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-19 23:13:00] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-19 23:13:01] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-19 23:13:01] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-19 23:13:01] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-19 23:13:01] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-19 23:13:01] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2023-03-19 23:13:02] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-19 23:13:02] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-19 23:13:02] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:13:02] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-19 23:13:03] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-19 23:13:03] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-19 23:13:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5913 ms
[2023-03-19 23:13:03] [INFO ] After 22918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 642 ms.
[2023-03-19 23:13:04] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 148 ms.
Support contains 68 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 1073/1073 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1113 transition count 1068
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1108 transition count 1068
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 1108 transition count 1060
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 1100 transition count 1060
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 98 place count 1064 transition count 1024
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 1064 transition count 1024
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 1060 transition count 1020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 1059 transition count 1020
Applied a total of 115 rules in 137 ms. Remains 1059 /1113 variables (removed 54) and now considering 1020/1073 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 1059/1113 places, 1020/1073 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 142881 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142881 steps, saw 96727 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1020 rows 1059 cols
[2023-03-19 23:13:07] [INFO ] Computed 360 place invariants in 10 ms
[2023-03-19 23:13:07] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:13:08] [INFO ] [Nat]Absence check using 356 positive place invariants in 81 ms returned sat
[2023-03-19 23:13:08] [INFO ] [Nat]Absence check using 356 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 23:13:08] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:13:09] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 0 ms to minimize.
[2023-03-19 23:13:09] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 0 ms to minimize.
[2023-03-19 23:13:10] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:13:10] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 0 ms to minimize.
[2023-03-19 23:13:10] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2023-03-19 23:13:10] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-19 23:13:10] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-19 23:13:11] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2023-03-19 23:13:11] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:13:11] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 0 ms to minimize.
[2023-03-19 23:13:12] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2023-03-19 23:13:12] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:13:12] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-19 23:13:12] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
[2023-03-19 23:13:13] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-19 23:13:13] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2023-03-19 23:13:13] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-19 23:13:13] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:13:14] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2023-03-19 23:13:14] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:13:14] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 1 ms to minimize.
[2023-03-19 23:13:15] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-19 23:13:15] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-19 23:13:15] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-19 23:13:15] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:13:16] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 0 ms to minimize.
[2023-03-19 23:13:16] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2023-03-19 23:13:16] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:13:17] [INFO ] Deduced a trap composed of 8 places in 496 ms of which 1 ms to minimize.
[2023-03-19 23:13:17] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-19 23:13:17] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:13:17] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:13:18] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:13:18] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9169 ms
[2023-03-19 23:13:18] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2023-03-19 23:13:19] [INFO ] Deduced a trap composed of 11 places in 321 ms of which 0 ms to minimize.
[2023-03-19 23:13:19] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-19 23:13:19] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-19 23:13:20] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2023-03-19 23:13:20] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2023-03-19 23:13:20] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2023-03-19 23:13:20] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2023-03-19 23:13:21] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-19 23:13:21] [INFO ] Deduced a trap composed of 7 places in 684 ms of which 1 ms to minimize.
[2023-03-19 23:13:22] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 0 ms to minimize.
[2023-03-19 23:13:22] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2023-03-19 23:13:22] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2023-03-19 23:13:23] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:13:23] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:13:23] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-19 23:13:23] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:13:24] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:13:24] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-19 23:13:24] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 14 ms to minimize.
[2023-03-19 23:13:24] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2023-03-19 23:13:25] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-19 23:13:25] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2023-03-19 23:13:25] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-19 23:13:25] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 0 ms to minimize.
[2023-03-19 23:13:25] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2023-03-19 23:13:26] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2023-03-19 23:13:26] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-19 23:13:26] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-19 23:13:26] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-19 23:13:26] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:13:26] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8473 ms
[2023-03-19 23:13:26] [INFO ] After 18646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-19 23:13:27] [INFO ] After 19346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 56 ms.
Support contains 68 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 1020/1020 transitions.
Applied a total of 0 rules in 29 ms. Remains 1059 /1059 variables (removed 0) and now considering 1020/1020 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1059/1059 places, 1020/1020 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 1020/1020 transitions.
Applied a total of 0 rules in 21 ms. Remains 1059 /1059 variables (removed 0) and now considering 1020/1020 (removed 0) transitions.
[2023-03-19 23:13:27] [INFO ] Invariant cache hit.
[2023-03-19 23:13:28] [INFO ] Implicit Places using invariants in 617 ms returned []
[2023-03-19 23:13:28] [INFO ] Invariant cache hit.
[2023-03-19 23:13:29] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2023-03-19 23:13:29] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-19 23:13:29] [INFO ] Invariant cache hit.
[2023-03-19 23:13:30] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2905 ms. Remains : 1059/1059 places, 1020/1020 transitions.
Applied a total of 0 rules in 22 ms. Remains 1059 /1059 variables (removed 0) and now considering 1020/1020 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 23:13:30] [INFO ] Invariant cache hit.
[2023-03-19 23:13:30] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:13:30] [INFO ] [Nat]Absence check using 356 positive place invariants in 52 ms returned sat
[2023-03-19 23:13:30] [INFO ] [Nat]Absence check using 356 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 23:13:31] [INFO ] After 651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:13:31] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 2 ms to minimize.
[2023-03-19 23:13:31] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 3 ms to minimize.
[2023-03-19 23:13:32] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-19 23:13:32] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 0 ms to minimize.
[2023-03-19 23:13:32] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 14 ms to minimize.
[2023-03-19 23:13:32] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2023-03-19 23:13:33] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
[2023-03-19 23:13:33] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-19 23:13:33] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2023-03-19 23:13:33] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:13:34] [INFO ] Deduced a trap composed of 8 places in 284 ms of which 13 ms to minimize.
[2023-03-19 23:13:34] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 13 ms to minimize.
[2023-03-19 23:13:35] [INFO ] Deduced a trap composed of 3 places in 371 ms of which 1 ms to minimize.
[2023-03-19 23:13:35] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-19 23:13:35] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2023-03-19 23:13:36] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 1 ms to minimize.
[2023-03-19 23:13:36] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-19 23:13:36] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:13:36] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:13:36] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2023-03-19 23:13:37] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-19 23:13:37] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2023-03-19 23:13:37] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-19 23:13:37] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-19 23:13:38] [INFO ] Deduced a trap composed of 9 places in 605 ms of which 1 ms to minimize.
[2023-03-19 23:13:38] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:13:39] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-19 23:13:39] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2023-03-19 23:13:39] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-19 23:13:39] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-19 23:13:39] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-19 23:13:39] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8422 ms
[2023-03-19 23:13:40] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 0 ms to minimize.
[2023-03-19 23:13:40] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-19 23:13:40] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-19 23:13:41] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-19 23:13:41] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-19 23:13:41] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-19 23:13:41] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-19 23:13:41] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-19 23:13:42] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2023-03-19 23:13:42] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:13:42] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-19 23:13:42] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:13:42] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2023-03-19 23:13:43] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-19 23:13:43] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-19 23:13:43] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-03-19 23:13:43] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-19 23:13:44] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2023-03-19 23:13:44] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2023-03-19 23:13:44] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-19 23:13:44] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-19 23:13:44] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-19 23:13:45] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 0 ms to minimize.
[2023-03-19 23:13:45] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-19 23:13:45] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-19 23:13:45] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-19 23:13:45] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-19 23:13:46] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:13:46] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2023-03-19 23:13:46] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6195 ms
[2023-03-19 23:13:46] [INFO ] After 15577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-19 23:13:46] [INFO ] After 16137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 23:13:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-19 23:13:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1059 places, 1020 transitions and 4726 arcs took 13 ms.
[2023-03-19 23:13:47] [INFO ] Flatten gal took : 150 ms
Total runtime 127034 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-040B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityFireability

FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679267628437

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityFireability.xml
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: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
lola: LAUNCH task # 11 (type EXCL) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-11
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 3 ShieldIIPs-PT-040B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 7 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-11
lola: result : true
lola: fired transitions : 170
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 8 (type EQUN) for ShieldIIPs-PT-040B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 10 (type SRCH) for ShieldIIPs-PT-040B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldIIPs-PT-040B-ReachabilityFireability-11 (obsolete)
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
lola: LAUNCH task # 18 (type EXCL) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-08
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 0 ShieldIIPs-PT-040B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type SRCH) for ShieldIIPs-PT-040B-ReachabilityFireability-08
lola: result : true
lola: markings : 98
lola: fired transitions : 97
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 15 (type EQUN) for ShieldIIPs-PT-040B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 18 (type EXCL) for ShieldIIPs-PT-040B-ReachabilityFireability-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-040B-ReachabilityFireability-08: AG false tandem / insertion
ShieldIIPs-PT-040B-ReachabilityFireability-11: AG false findpath


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="ShieldIIPs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903714900143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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