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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 528K 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 ShieldPPPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679276041216

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=ShieldPPPs-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:34:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:34:03] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-20 01:34:03] [INFO ] Transformed 2043 places.
[2023-03-20 01:34:03] [INFO ] Transformed 1893 transitions.
[2023-03-20 01:34:03] [INFO ] Found NUPN structural information;
[2023-03-20 01:34:03] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-20 01:34:04] [INFO ] Computed 331 place invariants in 26 ms
[2023-03-20 01:34:06] [INFO ] [Real]Absence check using 331 positive place invariants in 125 ms returned sat
[2023-03-20 01:34:06] [INFO ] After 1192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 01:34:07] [INFO ] [Nat]Absence check using 331 positive place invariants in 146 ms returned sat
[2023-03-20 01:34:11] [INFO ] After 4347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 01:34:12] [INFO ] Deduced a trap composed of 24 places in 830 ms of which 32 ms to minimize.
[2023-03-20 01:34:14] [INFO ] Deduced a trap composed of 23 places in 875 ms of which 3 ms to minimize.
[2023-03-20 01:34:14] [INFO ] Deduced a trap composed of 18 places in 691 ms of which 2 ms to minimize.
[2023-03-20 01:34:15] [INFO ] Deduced a trap composed of 23 places in 705 ms of which 4 ms to minimize.
[2023-03-20 01:34:16] [INFO ] Deduced a trap composed of 21 places in 629 ms of which 2 ms to minimize.
[2023-03-20 01:34:17] [INFO ] Deduced a trap composed of 30 places in 769 ms of which 14 ms to minimize.
[2023-03-20 01:34:18] [INFO ] Deduced a trap composed of 24 places in 823 ms of which 2 ms to minimize.
[2023-03-20 01:34:18] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 1 ms to minimize.
[2023-03-20 01:34:19] [INFO ] Deduced a trap composed of 14 places in 633 ms of which 17 ms to minimize.
[2023-03-20 01:34:20] [INFO ] Deduced a trap composed of 38 places in 856 ms of which 1 ms to minimize.
[2023-03-20 01:34:21] [INFO ] Deduced a trap composed of 27 places in 566 ms of which 2 ms to minimize.
[2023-03-20 01:34:21] [INFO ] Deduced a trap composed of 23 places in 581 ms of which 1 ms to minimize.
[2023-03-20 01:34:22] [INFO ] Deduced a trap composed of 24 places in 714 ms of which 2 ms to minimize.
[2023-03-20 01:34:23] [INFO ] Deduced a trap composed of 28 places in 506 ms of which 1 ms to minimize.
[2023-03-20 01:34:24] [INFO ] Deduced a trap composed of 32 places in 608 ms of which 1 ms to minimize.
[2023-03-20 01:34:24] [INFO ] Deduced a trap composed of 19 places in 508 ms of which 1 ms to minimize.
[2023-03-20 01:34:25] [INFO ] Deduced a trap composed of 20 places in 556 ms of which 1 ms to minimize.
[2023-03-20 01:34:25] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 2 ms to minimize.
[2023-03-20 01:34:26] [INFO ] Deduced a trap composed of 11 places in 437 ms of which 1 ms to minimize.
[2023-03-20 01:34:26] [INFO ] Deduced a trap composed of 30 places in 471 ms of which 1 ms to minimize.
[2023-03-20 01:34:27] [INFO ] Deduced a trap composed of 19 places in 442 ms of which 1 ms to minimize.
[2023-03-20 01:34:27] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 1 ms to minimize.
[2023-03-20 01:34:28] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 2 ms to minimize.
[2023-03-20 01:34:29] [INFO ] Deduced a trap composed of 19 places in 443 ms of which 1 ms to minimize.
[2023-03-20 01:34:29] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 1 ms to minimize.
[2023-03-20 01:34:30] [INFO ] Deduced a trap composed of 42 places in 510 ms of which 1 ms to minimize.
[2023-03-20 01:34:30] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 1 ms to minimize.
[2023-03-20 01:34:31] [INFO ] Deduced a trap composed of 27 places in 457 ms of which 1 ms to minimize.
[2023-03-20 01:34:31] [INFO ] Deduced a trap composed of 42 places in 389 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-20 01:34:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:34:31] [INFO ] After 25365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 720 ms.
Support contains 182 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 2043 transition count 1728
Reduce places removed 165 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 177 rules applied. Total rules applied 342 place count 1878 transition count 1716
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 354 place count 1866 transition count 1716
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 354 place count 1866 transition count 1569
Deduced a syphon composed of 147 places in 4 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 648 place count 1719 transition count 1569
Discarding 168 places :
Symmetric choice reduction at 3 with 168 rule applications. Total rules 816 place count 1551 transition count 1401
Iterating global reduction 3 with 168 rules applied. Total rules applied 984 place count 1551 transition count 1401
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 984 place count 1551 transition count 1344
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1098 place count 1494 transition count 1344
Performed 385 Post agglomeration using F-continuation condition.Transition count delta: 385
Deduced a syphon composed of 385 places in 3 ms
Reduce places removed 385 places and 0 transitions.
Iterating global reduction 3 with 770 rules applied. Total rules applied 1868 place count 1109 transition count 959
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 3 with 201 rules applied. Total rules applied 2069 place count 1109 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2070 place count 1108 transition count 958
Applied a total of 2070 rules in 578 ms. Remains 1108 /2043 variables (removed 935) and now considering 958/1893 (removed 935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 1108/2043 places, 958/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 8) seen :4
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 958 rows 1108 cols
[2023-03-20 01:34:33] [INFO ] Computed 331 place invariants in 15 ms
[2023-03-20 01:34:33] [INFO ] [Real]Absence check using 318 positive place invariants in 60 ms returned sat
[2023-03-20 01:34:33] [INFO ] [Real]Absence check using 318 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-20 01:34:33] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:34:34] [INFO ] [Nat]Absence check using 318 positive place invariants in 82 ms returned sat
[2023-03-20 01:34:34] [INFO ] [Nat]Absence check using 318 positive and 13 generalized place invariants in 37 ms returned sat
[2023-03-20 01:34:35] [INFO ] After 1053ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:34:35] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:34:35] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2023-03-20 01:34:35] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-20 01:34:36] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:34:36] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 1 ms to minimize.
[2023-03-20 01:34:36] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-20 01:34:36] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 2 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 18 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2023-03-20 01:34:38] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 0 ms to minimize.
[2023-03-20 01:34:38] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 6 ms to minimize.
[2023-03-20 01:34:38] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 1 ms to minimize.
[2023-03-20 01:34:39] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2023-03-20 01:34:39] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3874 ms
[2023-03-20 01:34:39] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 1 ms to minimize.
[2023-03-20 01:34:39] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-20 01:34:40] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-20 01:34:40] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2023-03-20 01:34:40] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-20 01:34:40] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 1 ms to minimize.
[2023-03-20 01:34:40] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 20 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2023-03-20 01:34:42] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2023-03-20 01:34:42] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:34:42] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:34:43] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 1 ms to minimize.
[2023-03-20 01:34:43] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 0 ms to minimize.
[2023-03-20 01:34:43] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-20 01:34:43] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4349 ms
[2023-03-20 01:34:44] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2023-03-20 01:34:44] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 2 ms to minimize.
[2023-03-20 01:34:44] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:34:45] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2023-03-20 01:34:45] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 2 ms to minimize.
[2023-03-20 01:34:45] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2023-03-20 01:34:46] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 5 ms to minimize.
[2023-03-20 01:34:46] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2023-03-20 01:34:46] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 0 ms to minimize.
[2023-03-20 01:34:47] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 1 ms to minimize.
[2023-03-20 01:34:47] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:34:47] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:34:47] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2023-03-20 01:34:48] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 1 ms to minimize.
[2023-03-20 01:34:48] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2023-03-20 01:34:48] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 1 ms to minimize.
[2023-03-20 01:34:48] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:34:49] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-20 01:34:49] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:34:49] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 0 ms to minimize.
[2023-03-20 01:34:50] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 1 ms to minimize.
[2023-03-20 01:34:50] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-20 01:34:50] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-20 01:34:50] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-20 01:34:51] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 0 ms to minimize.
[2023-03-20 01:34:51] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-20 01:34:51] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 0 ms to minimize.
[2023-03-20 01:34:51] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-20 01:34:52] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:34:52] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 0 ms to minimize.
[2023-03-20 01:34:52] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:34:52] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2023-03-20 01:34:53] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2023-03-20 01:34:53] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:34:53] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:34:53] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-03-20 01:34:53] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9655 ms
[2023-03-20 01:34:53] [INFO ] After 19666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1138 ms.
[2023-03-20 01:34:54] [INFO ] After 21123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 112 ms.
Support contains 106 out of 1108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 958/958 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1108 transition count 950
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1100 transition count 950
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16 place count 1100 transition count 944
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 1094 transition count 944
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1093 transition count 943
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1093 transition count 943
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 1093 transition count 942
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 1092 transition count 942
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 138 place count 1039 transition count 889
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 165 place count 1039 transition count 889
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 1038 transition count 888
Applied a total of 166 rules in 321 ms. Remains 1038 /1108 variables (removed 70) and now considering 888/958 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 1038/1108 places, 888/958 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 888 rows 1038 cols
[2023-03-20 01:34:55] [INFO ] Computed 331 place invariants in 11 ms
[2023-03-20 01:34:55] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:34:56] [INFO ] [Nat]Absence check using 317 positive place invariants in 109 ms returned sat
[2023-03-20 01:34:56] [INFO ] [Nat]Absence check using 317 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-20 01:34:57] [INFO ] After 1430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:34:58] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-20 01:34:58] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2023-03-20 01:34:58] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2023-03-20 01:34:59] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-20 01:34:59] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-20 01:34:59] [INFO ] Deduced a trap composed of 6 places in 384 ms of which 6 ms to minimize.
[2023-03-20 01:35:00] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 0 ms to minimize.
[2023-03-20 01:35:00] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-20 01:35:00] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-20 01:35:00] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-20 01:35:01] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-20 01:35:01] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-20 01:35:01] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 3 ms to minimize.
[2023-03-20 01:35:02] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 0 ms to minimize.
[2023-03-20 01:35:02] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-20 01:35:02] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-20 01:35:03] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 0 ms to minimize.
[2023-03-20 01:35:03] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2023-03-20 01:35:03] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-20 01:35:03] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-20 01:35:04] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 0 ms to minimize.
[2023-03-20 01:35:04] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:35:04] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-20 01:35:04] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:35:05] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-20 01:35:05] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 0 ms to minimize.
[2023-03-20 01:35:06] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 8078 ms
[2023-03-20 01:35:06] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2023-03-20 01:35:07] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2023-03-20 01:35:07] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:35:07] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 0 ms to minimize.
[2023-03-20 01:35:07] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 0 ms to minimize.
[2023-03-20 01:35:08] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2023-03-20 01:35:08] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 0 ms to minimize.
[2023-03-20 01:35:08] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-20 01:35:09] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:35:09] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2023-03-20 01:35:09] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:35:09] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-20 01:35:10] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2023-03-20 01:35:10] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:35:10] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-20 01:35:10] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2023-03-20 01:35:10] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-20 01:35:11] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-20 01:35:11] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-20 01:35:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4722 ms
[2023-03-20 01:35:11] [INFO ] After 15150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1074 ms.
[2023-03-20 01:35:12] [INFO ] After 16675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 42 ms.
Support contains 103 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 888/888 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1037 transition count 887
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1037 transition count 887
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1036 transition count 886
Applied a total of 4 rules in 227 ms. Remains 1036 /1038 variables (removed 2) and now considering 886/888 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1036/1038 places, 886/888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 117879 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117879 steps, saw 108958 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 886 rows 1036 cols
[2023-03-20 01:35:16] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-20 01:35:16] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:35:16] [INFO ] [Nat]Absence check using 311 positive place invariants in 50 ms returned sat
[2023-03-20 01:35:16] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-20 01:35:17] [INFO ] After 1258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:35:18] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2023-03-20 01:35:18] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-20 01:35:18] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-20 01:35:18] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2023-03-20 01:35:19] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2023-03-20 01:35:19] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:35:19] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-20 01:35:19] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-20 01:35:20] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:35:20] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2023-03-20 01:35:20] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-20 01:35:20] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3734 ms
[2023-03-20 01:35:23] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 0 ms to minimize.
[2023-03-20 01:35:23] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:35:23] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2023-03-20 01:35:23] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-20 01:35:24] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-20 01:35:24] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:35:24] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2023-03-20 01:35:24] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-20 01:35:25] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-20 01:35:25] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:35:25] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2023-03-20 01:35:25] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-20 01:35:26] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-20 01:35:26] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-20 01:35:26] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 0 ms to minimize.
[2023-03-20 01:35:26] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:35:27] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 0 ms to minimize.
[2023-03-20 01:35:27] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-20 01:35:27] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-20 01:35:27] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2023-03-20 01:35:27] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2023-03-20 01:35:28] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 0 ms to minimize.
[2023-03-20 01:35:28] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 0 ms to minimize.
[2023-03-20 01:35:29] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-20 01:35:29] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:35:29] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-20 01:35:29] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-20 01:35:29] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-20 01:35:30] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:35:30] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2023-03-20 01:35:30] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:35:30] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 7790 ms
[2023-03-20 01:35:30] [INFO ] After 14007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1055 ms.
[2023-03-20 01:35:31] [INFO ] After 15364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 83 ms.
Support contains 103 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 35 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1036/1036 places, 886/886 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 36 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2023-03-20 01:35:31] [INFO ] Invariant cache hit.
[2023-03-20 01:35:32] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-20 01:35:32] [INFO ] Invariant cache hit.
[2023-03-20 01:35:34] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2023-03-20 01:35:34] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-20 01:35:34] [INFO ] Invariant cache hit.
[2023-03-20 01:35:35] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3187 ms. Remains : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 52 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:35:35] [INFO ] Invariant cache hit.
[2023-03-20 01:35:35] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:35:35] [INFO ] [Nat]Absence check using 311 positive place invariants in 64 ms returned sat
[2023-03-20 01:35:35] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 28 ms returned sat
[2023-03-20 01:35:37] [INFO ] After 1760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:35:37] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2023-03-20 01:35:37] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:35:38] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-20 01:35:38] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-20 01:35:38] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2023-03-20 01:35:38] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-20 01:35:38] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-20 01:35:39] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:35:39] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2023-03-20 01:35:39] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2023-03-20 01:35:39] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 1 ms to minimize.
[2023-03-20 01:35:40] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:35:40] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2023-03-20 01:35:40] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-20 01:35:40] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 01:35:40] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-20 01:35:41] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 12 ms to minimize.
[2023-03-20 01:35:41] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-20 01:35:41] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 01:35:41] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-20 01:35:42] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:35:42] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-20 01:35:42] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:35:42] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-20 01:35:42] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-20 01:35:43] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 2 ms to minimize.
[2023-03-20 01:35:43] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-20 01:35:43] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 1 ms to minimize.
[2023-03-20 01:35:43] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-20 01:35:44] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 1 ms to minimize.
[2023-03-20 01:35:44] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-20 01:35:44] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-20 01:35:44] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2023-03-20 01:35:44] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2023-03-20 01:35:45] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-20 01:35:45] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7593 ms
[2023-03-20 01:35:46] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-20 01:35:46] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 14 ms to minimize.
[2023-03-20 01:35:46] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:35:47] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:35:47] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 1 ms to minimize.
[2023-03-20 01:35:47] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:35:47] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2023-03-20 01:35:48] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2023-03-20 01:35:48] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2023-03-20 01:35:48] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 4 ms to minimize.
[2023-03-20 01:35:48] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-20 01:35:49] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 0 ms to minimize.
[2023-03-20 01:35:50] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 0 ms to minimize.
[2023-03-20 01:35:50] [INFO ] Deduced a trap composed of 26 places in 291 ms of which 1 ms to minimize.
[2023-03-20 01:35:50] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 0 ms to minimize.
[2023-03-20 01:35:51] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:35:51] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 0 ms to minimize.
[2023-03-20 01:35:51] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-03-20 01:35:52] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 14 ms to minimize.
[2023-03-20 01:35:52] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-20 01:35:52] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 2 ms to minimize.
[2023-03-20 01:35:52] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 4 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 13 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 4 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8672 ms
[2023-03-20 01:35:54] [INFO ] After 19120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1900 ms.
[2023-03-20 01:35:56] [INFO ] After 21313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:35:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 28 ms.
[2023-03-20 01:35:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1036 places, 886 transitions and 3766 arcs took 18 ms.
[2023-03-20 01:35:57] [INFO ] Flatten gal took : 121 ms
Total runtime 113671 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-030B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityFireability

FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679276158995

--------------------
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/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
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 0 ShieldPPPs-PT-030B-ReachabilityFireability-11
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 ShieldPPPs-PT-030B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 ShieldPPPs-PT-030B-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: LAUNCH task # 10 (type SRCH) for 0 ShieldPPPs-PT-030B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 10 (type SRCH) for ShieldPPPs-PT-030B-ReachabilityFireability-11
lola: result : true
lola: markings : 98
lola: fired transitions : 97
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for ShieldPPPs-PT-030B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 8 (type EQUN) for ShieldPPPs-PT-030B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldPPPs-PT-030B-ReachabilityFireability-11 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 ShieldPPPs-PT-030B-ReachabilityFireability-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 ShieldPPPs-PT-030B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 ShieldPPPs-PT-030B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type SRCH) for 3 ShieldPPPs-PT-030B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type FNDP) for ShieldPPPs-PT-030B-ReachabilityFireability-11
lola: result : true
lola: fired transitions : 96
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 16 (type SRCH) for ShieldPPPs-PT-030B-ReachabilityFireability-13
lola: result : true
lola: markings : 83
lola: fired transitions : 82
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldPPPs-PT-030B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldPPPs-PT-030B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldPPPs-PT-030B-ReachabilityFireability-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-ReachabilityFireability-11: AG false tandem / insertion
ShieldPPPs-PT-030B-ReachabilityFireability-13: EF true tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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-167903715300479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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