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-167903715500639.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 ShieldPPPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679279406764

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=ShieldPPPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:30:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:30:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:30:09] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-20 02:30:09] [INFO ] Transformed 1563 places.
[2023-03-20 02:30:09] [INFO ] Transformed 1423 transitions.
[2023-03-20 02:30:09] [INFO ] Found NUPN structural information;
[2023-03-20 02:30:09] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-20 02:30:10] [INFO ] Computed 221 place invariants in 18 ms
[2023-03-20 02:30:11] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:30:12] [INFO ] [Nat]Absence check using 221 positive place invariants in 124 ms returned sat
[2023-03-20 02:30:14] [INFO ] After 1926ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-20 02:30:15] [INFO ] Deduced a trap composed of 30 places in 456 ms of which 17 ms to minimize.
[2023-03-20 02:30:15] [INFO ] Deduced a trap composed of 24 places in 339 ms of which 2 ms to minimize.
[2023-03-20 02:30:15] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 0 ms to minimize.
[2023-03-20 02:30:16] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 1 ms to minimize.
[2023-03-20 02:30:16] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:30:16] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 1 ms to minimize.
[2023-03-20 02:30:17] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:30:17] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 1 ms to minimize.
[2023-03-20 02:30:17] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 1 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 0 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 1 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 0 ms to minimize.
[2023-03-20 02:30:19] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:30:19] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:30:19] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 0 ms to minimize.
[2023-03-20 02:30:19] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:30:20] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 0 ms to minimize.
[2023-03-20 02:30:20] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 0 ms to minimize.
[2023-03-20 02:30:20] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 0 ms to minimize.
[2023-03-20 02:30:21] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2023-03-20 02:30:21] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2023-03-20 02:30:21] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 1 ms to minimize.
[2023-03-20 02:30:21] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2023-03-20 02:30:22] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 1 ms to minimize.
[2023-03-20 02:30:22] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 0 ms to minimize.
[2023-03-20 02:30:22] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7975 ms
[2023-03-20 02:30:22] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 1 ms to minimize.
[2023-03-20 02:30:23] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 1 ms to minimize.
[2023-03-20 02:30:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 742 ms
[2023-03-20 02:30:23] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 0 ms to minimize.
[2023-03-20 02:30:23] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 1 ms to minimize.
[2023-03-20 02:30:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2023-03-20 02:30:24] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 0 ms to minimize.
[2023-03-20 02:30:24] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 1 ms to minimize.
[2023-03-20 02:30:25] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 1 ms to minimize.
[2023-03-20 02:30:25] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 4 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 1 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 0 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 1 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 13 ms to minimize.
[2023-03-20 02:30:28] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 1 ms to minimize.
[2023-03-20 02:30:28] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 1 ms to minimize.
[2023-03-20 02:30:28] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 2 ms to minimize.
[2023-03-20 02:30:29] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 0 ms to minimize.
[2023-03-20 02:30:29] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:30:29] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 1 ms to minimize.
[2023-03-20 02:30:30] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 1 ms to minimize.
[2023-03-20 02:30:30] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2023-03-20 02:30:30] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 0 ms to minimize.
[2023-03-20 02:30:31] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 1 ms to minimize.
[2023-03-20 02:30:31] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 12 ms to minimize.
[2023-03-20 02:30:31] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:30:31] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 1 ms to minimize.
[2023-03-20 02:30:32] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 0 ms to minimize.
[2023-03-20 02:30:32] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:30:32] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 10 ms to minimize.
[2023-03-20 02:30:33] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 0 ms to minimize.
[2023-03-20 02:30:33] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 0 ms to minimize.
[2023-03-20 02:30:33] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 1 ms to minimize.
[2023-03-20 02:30:33] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 0 ms to minimize.
[2023-03-20 02:30:34] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 0 ms to minimize.
[2023-03-20 02:30:34] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:30:34] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 0 ms to minimize.
[2023-03-20 02:30:35] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 5 ms to minimize.
[2023-03-20 02:30:35] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 4 ms to minimize.
[2023-03-20 02:30:35] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 0 ms to minimize.
[2023-03-20 02:30:35] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2023-03-20 02:30:35] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 11678 ms
[2023-03-20 02:30:36] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 8 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-20 02:30:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:30:36] [INFO ] After 25212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 269 ms.
Support contains 97 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 312 place count 1563 transition count 1111
Reduce places removed 312 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 339 rules applied. Total rules applied 651 place count 1251 transition count 1084
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 678 place count 1224 transition count 1084
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 678 place count 1224 transition count 1007
Deduced a syphon composed of 77 places in 6 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 832 place count 1147 transition count 1007
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 952 place count 1027 transition count 887
Iterating global reduction 3 with 120 rules applied. Total rules applied 1072 place count 1027 transition count 887
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 1074 place count 1027 transition count 885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1075 place count 1026 transition count 885
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1075 place count 1026 transition count 845
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1155 place count 986 transition count 845
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 2 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 5 with 620 rules applied. Total rules applied 1775 place count 676 transition count 535
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 14 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1859 place count 634 transition count 535
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1862 place count 634 transition count 532
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1865 place count 631 transition count 532
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 1915 place count 631 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1916 place count 630 transition count 531
Applied a total of 1916 rules in 506 ms. Remains 630 /1563 variables (removed 933) and now considering 531/1423 (removed 892) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 630/1563 places, 531/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 154586 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154586 steps, saw 125781 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 531 rows 630 cols
[2023-03-20 02:30:40] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-20 02:30:41] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 02:30:41] [INFO ] [Nat]Absence check using 221 positive place invariants in 51 ms returned sat
[2023-03-20 02:30:42] [INFO ] After 635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 02:30:42] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-20 02:30:42] [INFO ] After 483ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 02:30:42] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2023-03-20 02:30:42] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2023-03-20 02:30:42] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1554 ms
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 989 ms
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1119 ms
[2023-03-20 02:30:47] [INFO ] After 5115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 407 ms.
[2023-03-20 02:30:47] [INFO ] After 6521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 102 ms.
Support contains 97 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 531/531 transitions.
Applied a total of 0 rules in 21 ms. Remains 630 /630 variables (removed 0) and now considering 531/531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 630/630 places, 531/531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 531/531 transitions.
Applied a total of 0 rules in 21 ms. Remains 630 /630 variables (removed 0) and now considering 531/531 (removed 0) transitions.
[2023-03-20 02:30:47] [INFO ] Invariant cache hit.
[2023-03-20 02:30:48] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-20 02:30:48] [INFO ] Invariant cache hit.
[2023-03-20 02:30:48] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-20 02:30:49] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
[2023-03-20 02:30:49] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 02:30:49] [INFO ] Invariant cache hit.
[2023-03-20 02:30:49] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1920 ms. Remains : 630/630 places, 531/531 transitions.
Partial Free-agglomeration rule applied 83 times.
Drop transitions removed 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 83 place count 630 transition count 531
Applied a total of 83 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 531/531 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 531 rows 630 cols
[2023-03-20 02:30:49] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-20 02:30:49] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 02:30:50] [INFO ] [Nat]Absence check using 221 positive place invariants in 46 ms returned sat
[2023-03-20 02:30:51] [INFO ] After 639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 02:30:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-20 02:30:51] [INFO ] After 503ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 02:30:51] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2023-03-20 02:30:51] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-03-20 02:30:52] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-20 02:30:52] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-20 02:30:52] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-03-20 02:30:52] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-20 02:30:52] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2023-03-20 02:30:52] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-20 02:30:52] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-20 02:30:53] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2023-03-20 02:30:54] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2023-03-20 02:30:54] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-03-20 02:30:54] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2664 ms
[2023-03-20 02:30:54] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-20 02:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-20 02:30:54] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-20 02:30:54] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-20 02:30:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-20 02:30:55] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-20 02:30:55] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-20 02:30:55] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-20 02:30:55] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 02:30:55] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-20 02:30:55] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-20 02:30:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 872 ms
[2023-03-20 02:30:55] [INFO ] After 4885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-20 02:30:56] [INFO ] After 6572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-20 02:30:56] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-20 02:30:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 630 places, 531 transitions and 2039 arcs took 4 ms.
[2023-03-20 02:30:56] [INFO ] Flatten gal took : 86 ms
Total runtime 47920 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/382
ReachabilityFireability

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679279458146

--------------------
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/382/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/382/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/382/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: 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 # 35 (type EXCL) for 3 ShieldPPPt-PT-020B-ReachabilityFireability-03
lola: time limit : 300 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 31 (type FNDP) for 3 ShieldPPPt-PT-020B-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 3 ShieldPPPt-PT-020B-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 3 ShieldPPPt-PT-020B-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: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: Created skeleton in 0.000000 secs.
lola: FINISHED task # 34 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-03
lola: result : true
lola: markings : 48
lola: fired transitions : 47
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 31 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 32 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 35 (type EXCL) for ShieldPPPt-PT-020B-ReachabilityFireability-03 (obsolete)
lola: LAUNCH task # 41 (type EXCL) for 0 ShieldPPPt-PT-020B-ReachabilityFireability-02
lola: time limit : 450 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 37 (type FNDP) for 0 ShieldPPPt-PT-020B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type EQUN) for 0 ShieldPPPt-PT-020B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type SRCH) for 0 ShieldPPPt-PT-020B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/382/ReachabilityFireability-32.sara.
lola: FINISHED task # 37 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 46
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 38 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 40 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 41 (type EXCL) for ShieldPPPt-PT-020B-ReachabilityFireability-02 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
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 # 54 (type EXCL) for 24 ShieldPPPt-PT-020B-ReachabilityFireability-12
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 44 (type FNDP) for 12 ShieldPPPt-PT-020B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type EQUN) for 12 ShieldPPPt-PT-020B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 47 (type SRCH) for 12 ShieldPPPt-PT-020B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 44 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-07
lola: result : true
lola: fired transitions : 35
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 45 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 47 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-07 (obsolete)
lola: LAUNCH task # 50 (type FNDP) for 24 ShieldPPPt-PT-020B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type EQUN) for 24 ShieldPPPt-PT-020B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 53 (type SRCH) for 24 ShieldPPPt-PT-020B-ReachabilityFireability-12
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
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 53 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-12
lola: result : true
lola: markings : 32
lola: fired transitions : 31
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 50 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 51 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 54 (type EXCL) for ShieldPPPt-PT-020B-ReachabilityFireability-12 (obsolete)
lola: LAUNCH task # 66 (type EXCL) for 18 ShieldPPPt-PT-020B-ReachabilityFireability-09
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 43 (type FNDP) for 9 ShieldPPPt-PT-020B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type EQUN) for 9 ShieldPPPt-PT-020B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 9 ShieldPPPt-PT-020B-ReachabilityFireability-05
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 # 50 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-12
lola: result : true
lola: fired transitions : 30
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 31 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-03
lola: result : true
lola: fired transitions : 46
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 59 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-05
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 43 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 57 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 62 (type FNDP) for 18 ShieldPPPt-PT-020B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type EQUN) for 18 ShieldPPPt-PT-020B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 65 (type SRCH) for 18 ShieldPPPt-PT-020B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 43 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-05
lola: result : unknown
lola: fired transitions : 10571
lola: tried executions : 3525
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/382/ReachabilityFireability-38.sara.
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: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 # 62 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 45
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/382/ReachabilityFireability-51.sara.
lola: CANCELED task # 63 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 65 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 66 (type EXCL) for ShieldPPPt-PT-020B-ReachabilityFireability-09 (obsolete)
lola: LAUNCH task # 73 (type EXCL) for 21 ShieldPPPt-PT-020B-ReachabilityFireability-10
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 75 (type FNDP) for 27 ShieldPPPt-PT-020B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 76 (type EQUN) for 27 ShieldPPPt-PT-020B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 78 (type SRCH) for 27 ShieldPPPt-PT-020B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/382/ReachabilityFireability-45.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/382/ReachabilityFireability-57.sara.
lola: FINISHED task # 65 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-09
lola: result : true
lola: markings : 47
lola: fired transitions : 46
lola: time used : 0.000000
lola: memory pages used : 1
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 # 75 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 80
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 76 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 78 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-13 (obsolete)
lola: LAUNCH task # 81 (type FNDP) for 15 ShieldPPPt-PT-020B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 82 (type EQUN) for 15 ShieldPPPt-PT-020B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 84 (type SRCH) for 15 ShieldPPPt-PT-020B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 84 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-08
lola: result : true
lola: markings : 40
lola: fired transitions : 39
lola: time used : 0.000000
lola: memory pages used : 1
sara: place or transition ordering is non-deterministic
lola: CANCELED task # 81 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 82 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 87 (type FNDP) for 6 ShieldPPPt-PT-020B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 88 (type EQUN) for 6 ShieldPPPt-PT-020B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 90 (type SRCH) for 6 ShieldPPPt-PT-020B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 81 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 38
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/382/ReachabilityFireability-63.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 90 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-04
lola: result : true
lola: markings : 28
lola: fired transitions : 27
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 87 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-04
lola: result : true
lola: fired transitions : 26
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
lola: CANCELED task # 88 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-04 (obsolete)
lola: LAUNCH task # 69 (type FNDP) for 21 ShieldPPPt-PT-020B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 70 (type EQUN) for 21 ShieldPPPt-PT-020B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 72 (type SRCH) for 21 ShieldPPPt-PT-020B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/382/ReachabilityFireability-82.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 72 (type SRCH) for ShieldPPPt-PT-020B-ReachabilityFireability-10
lola: result : true
lola: markings : 44
lola: fired transitions : 43
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 69 (type FNDP) for ShieldPPPt-PT-020B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 70 (type EQUN) for ShieldPPPt-PT-020B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 73 (type EXCL) for ShieldPPPt-PT-020B-ReachabilityFireability-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-ReachabilityFireability-02: EF true findpath
ShieldPPPt-PT-020B-ReachabilityFireability-03: AG false tandem / insertion
ShieldPPPt-PT-020B-ReachabilityFireability-04: EF true findpath
ShieldPPPt-PT-020B-ReachabilityFireability-05: EF false tandem / insertion
ShieldPPPt-PT-020B-ReachabilityFireability-07: EF true findpath
ShieldPPPt-PT-020B-ReachabilityFireability-08: EF true tandem / insertion
ShieldPPPt-PT-020B-ReachabilityFireability-09: AG false findpath
ShieldPPPt-PT-020B-ReachabilityFireability-10: AG false tandem / insertion
ShieldPPPt-PT-020B-ReachabilityFireability-12: EF true tandem / insertion
ShieldPPPt-PT-020B-ReachabilityFireability-13: EF true 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="ShieldPPPt-PT-020B"
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 ShieldPPPt-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 r391-oct2-167903715500639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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