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.r393-oct2-167903717100494.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 ltsminxred
Input is ShieldPPPs-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 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 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 708K 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-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679454737628

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:12:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 03:12:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:12:20] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-22 03:12:20] [INFO ] Transformed 2723 places.
[2023-03-22 03:12:20] [INFO ] Transformed 2523 transitions.
[2023-03-22 03:12:20] [INFO ] Found NUPN structural information;
[2023-03-22 03:12:20] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 14) seen :8
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-22 03:12:21] [INFO ] Computed 441 place invariants in 33 ms
[2023-03-22 03:12:22] [INFO ] After 1145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 03:12:23] [INFO ] [Nat]Absence check using 441 positive place invariants in 259 ms returned sat
[2023-03-22 03:12:27] [INFO ] After 3303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 03:12:28] [INFO ] Deduced a trap composed of 26 places in 834 ms of which 12 ms to minimize.
[2023-03-22 03:12:29] [INFO ] Deduced a trap composed of 14 places in 940 ms of which 4 ms to minimize.
[2023-03-22 03:12:30] [INFO ] Deduced a trap composed of 20 places in 785 ms of which 2 ms to minimize.
[2023-03-22 03:12:31] [INFO ] Deduced a trap composed of 21 places in 822 ms of which 2 ms to minimize.
[2023-03-22 03:12:34] [INFO ] Deduced a trap composed of 18 places in 1019 ms of which 2 ms to minimize.
[2023-03-22 03:12:35] [INFO ] Deduced a trap composed of 21 places in 1018 ms of which 13 ms to minimize.
[2023-03-22 03:12:36] [INFO ] Deduced a trap composed of 34 places in 802 ms of which 15 ms to minimize.
[2023-03-22 03:12:37] [INFO ] Deduced a trap composed of 22 places in 905 ms of which 1 ms to minimize.
[2023-03-22 03:12:38] [INFO ] Deduced a trap composed of 32 places in 1021 ms of which 2 ms to minimize.
[2023-03-22 03:12:40] [INFO ] Deduced a trap composed of 36 places in 1148 ms of which 3 ms to minimize.
[2023-03-22 03:12:41] [INFO ] Deduced a trap composed of 35 places in 1157 ms of which 2 ms to minimize.
[2023-03-22 03:12:42] [INFO ] Deduced a trap composed of 31 places in 875 ms of which 3 ms to minimize.
[2023-03-22 03:12:43] [INFO ] Deduced a trap composed of 23 places in 736 ms of which 2 ms to minimize.
[2023-03-22 03:12:44] [INFO ] Deduced a trap composed of 33 places in 725 ms of which 1 ms to minimize.
[2023-03-22 03:12:45] [INFO ] Deduced a trap composed of 25 places in 938 ms of which 2 ms to minimize.
[2023-03-22 03:12:46] [INFO ] Deduced a trap composed of 29 places in 801 ms of which 2 ms to minimize.
[2023-03-22 03:12:47] [INFO ] Deduced a trap composed of 35 places in 1067 ms of which 2 ms to minimize.
[2023-03-22 03:12:48] [INFO ] Deduced a trap composed of 25 places in 697 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:12:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:12:48] [INFO ] After 25181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 596 ms.
Support contains 51 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 2723 transition count 2262
Reduce places removed 261 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 270 rules applied. Total rules applied 531 place count 2462 transition count 2253
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 540 place count 2453 transition count 2253
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 540 place count 2453 transition count 2054
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 938 place count 2254 transition count 2054
Discarding 269 places :
Symmetric choice reduction at 3 with 269 rule applications. Total rules 1207 place count 1985 transition count 1785
Iterating global reduction 3 with 269 rules applied. Total rules applied 1476 place count 1985 transition count 1785
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 1476 place count 1985 transition count 1674
Deduced a syphon composed of 111 places in 26 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 1698 place count 1874 transition count 1674
Performed 576 Post agglomeration using F-continuation condition.Transition count delta: 576
Deduced a syphon composed of 576 places in 2 ms
Reduce places removed 576 places and 0 transitions.
Iterating global reduction 3 with 1152 rules applied. Total rules applied 2850 place count 1298 transition count 1098
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 341 times.
Drop transitions removed 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 3191 place count 1298 transition count 1098
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3192 place count 1297 transition count 1097
Applied a total of 3192 rules in 1465 ms. Remains 1297 /2723 variables (removed 1426) and now considering 1097/2523 (removed 1426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1465 ms. Remains : 1297/2723 places, 1097/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1097 rows 1297 cols
[2023-03-22 03:12:50] [INFO ] Computed 441 place invariants in 72 ms
[2023-03-22 03:12:50] [INFO ] [Real]Absence check using 416 positive place invariants in 65 ms returned sat
[2023-03-22 03:12:50] [INFO ] [Real]Absence check using 416 positive and 25 generalized place invariants in 4 ms returned sat
[2023-03-22 03:12:50] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 03:12:51] [INFO ] [Nat]Absence check using 416 positive place invariants in 84 ms returned sat
[2023-03-22 03:12:51] [INFO ] [Nat]Absence check using 416 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 03:13:01] [INFO ] After 9862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:13:01] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2023-03-22 03:13:01] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-22 03:13:02] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2023-03-22 03:13:02] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 13 ms to minimize.
[2023-03-22 03:13:02] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2023-03-22 03:13:02] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-22 03:13:02] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 13 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 11 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 4 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-22 03:13:05] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2023-03-22 03:13:05] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-22 03:13:05] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-22 03:13:05] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4482 ms
[2023-03-22 03:13:06] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 0 ms to minimize.
[2023-03-22 03:13:06] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-22 03:13:06] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 2 ms to minimize.
[2023-03-22 03:13:06] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-22 03:13:07] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2023-03-22 03:13:07] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2023-03-22 03:13:07] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 0 ms to minimize.
[2023-03-22 03:13:08] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-22 03:13:08] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-22 03:13:08] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-22 03:13:08] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 14 ms to minimize.
[2023-03-22 03:13:09] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-22 03:13:09] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2023-03-22 03:13:09] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-22 03:13:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3639 ms
[2023-03-22 03:13:09] [INFO ] After 18365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-22 03:13:09] [INFO ] After 18915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 87 ms.
Support contains 48 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 1097/1097 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1296 transition count 1096
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 1296 transition count 1096
Applied a total of 3 rules in 135 ms. Remains 1296 /1297 variables (removed 1) and now considering 1096/1097 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1296/1297 places, 1096/1097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1096 rows 1296 cols
[2023-03-22 03:13:10] [INFO ] Computed 441 place invariants in 19 ms
[2023-03-22 03:13:10] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:13:11] [INFO ] [Nat]Absence check using 418 positive place invariants in 114 ms returned sat
[2023-03-22 03:13:11] [INFO ] [Nat]Absence check using 418 positive and 23 generalized place invariants in 17 ms returned sat
[2023-03-22 03:13:20] [INFO ] After 9780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:13:21] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 21 ms to minimize.
[2023-03-22 03:13:21] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 0 ms to minimize.
[2023-03-22 03:13:21] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-22 03:13:22] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 4 ms to minimize.
[2023-03-22 03:13:22] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2023-03-22 03:13:22] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 0 ms to minimize.
[2023-03-22 03:13:22] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-22 03:13:23] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-22 03:13:23] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 13 ms to minimize.
[2023-03-22 03:13:23] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-22 03:13:23] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 13 ms to minimize.
[2023-03-22 03:13:23] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-22 03:13:24] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 4 ms to minimize.
[2023-03-22 03:13:24] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 2 ms to minimize.
[2023-03-22 03:13:24] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-22 03:13:24] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2023-03-22 03:13:25] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-22 03:13:25] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-22 03:13:25] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2023-03-22 03:13:25] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 19 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-22 03:13:26] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2023-03-22 03:13:27] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-22 03:13:27] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2023-03-22 03:13:27] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-22 03:13:27] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2023-03-22 03:13:27] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 0 ms to minimize.
[2023-03-22 03:13:28] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-22 03:13:28] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7093 ms
[2023-03-22 03:13:28] [INFO ] After 17091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-22 03:13:28] [INFO ] After 17668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 50 ms.
Support contains 47 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 1096/1096 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1295 transition count 1095
Applied a total of 2 rules in 113 ms. Remains 1295 /1296 variables (removed 1) and now considering 1095/1096 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1295/1296 places, 1095/1096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 2) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1095 rows 1295 cols
[2023-03-22 03:13:28] [INFO ] Computed 441 place invariants in 6 ms
[2023-03-22 03:13:28] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:13:29] [INFO ] [Nat]Absence check using 415 positive place invariants in 184 ms returned sat
[2023-03-22 03:13:29] [INFO ] [Nat]Absence check using 415 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-22 03:13:35] [INFO ] After 6203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 4 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2023-03-22 03:13:45] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-22 03:13:45] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-22 03:13:45] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 0 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-22 03:13:48] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-22 03:13:48] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-22 03:13:49] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 0 ms to minimize.
[2023-03-22 03:13:49] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2023-03-22 03:13:49] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-22 03:13:50] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2023-03-22 03:13:50] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-22 03:13:50] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9654 ms
[2023-03-22 03:13:50] [INFO ] After 21319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3291 ms.
[2023-03-22 03:13:54] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 53 ms.
Support contains 37 out of 1295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1295/1295 places, 1095/1095 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1295 transition count 1093
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1293 transition count 1093
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1293 transition count 1092
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1292 transition count 1092
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 1284 transition count 1084
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 1283 transition count 1083
Applied a total of 23 rules in 183 ms. Remains 1283 /1295 variables (removed 12) and now considering 1083/1095 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 1283/1295 places, 1083/1095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 166897 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166897 steps, saw 128557 distinct states, run finished after 3004 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1083 rows 1283 cols
[2023-03-22 03:13:57] [INFO ] Computed 441 place invariants in 31 ms
[2023-03-22 03:13:57] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:13:58] [INFO ] [Nat]Absence check using 423 positive place invariants in 174 ms returned sat
[2023-03-22 03:13:58] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-22 03:14:06] [INFO ] After 7989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:14:08] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2023-03-22 03:14:08] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-22 03:14:09] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2023-03-22 03:14:09] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2023-03-22 03:14:09] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 1 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
[2023-03-22 03:14:10] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 0 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 0 ms to minimize.
[2023-03-22 03:14:11] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-22 03:14:12] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-22 03:14:12] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 0 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 2 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 0 ms to minimize.
[2023-03-22 03:14:13] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 7 places in 323 ms of which 1 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 0 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-22 03:14:14] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-03-22 03:14:15] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-22 03:14:15] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:14:15] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2023-03-22 03:14:16] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2023-03-22 03:14:16] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-22 03:14:16] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 0 ms to minimize.
[2023-03-22 03:14:16] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-22 03:14:17] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-22 03:14:17] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9103 ms
[2023-03-22 03:14:17] [INFO ] After 19153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5518 ms.
[2023-03-22 03:14:22] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 ms.
Support contains 37 out of 1283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1283/1283 places, 1083/1083 transitions.
Applied a total of 0 rules in 50 ms. Remains 1283 /1283 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1283/1283 places, 1083/1083 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1283/1283 places, 1083/1083 transitions.
Applied a total of 0 rules in 35 ms. Remains 1283 /1283 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
[2023-03-22 03:14:22] [INFO ] Invariant cache hit.
[2023-03-22 03:14:23] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2023-03-22 03:14:23] [INFO ] Invariant cache hit.
[2023-03-22 03:14:25] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
[2023-03-22 03:14:25] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-22 03:14:25] [INFO ] Invariant cache hit.
[2023-03-22 03:14:26] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3795 ms. Remains : 1283/1283 places, 1083/1083 transitions.
Applied a total of 0 rules in 40 ms. Remains 1283 /1283 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 03:14:26] [INFO ] Invariant cache hit.
[2023-03-22 03:14:26] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:14:27] [INFO ] [Nat]Absence check using 423 positive place invariants in 61 ms returned sat
[2023-03-22 03:14:27] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-22 03:14:35] [INFO ] After 8269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:14:43] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-22 03:14:43] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2023-03-22 03:14:43] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-22 03:14:43] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-22 03:14:43] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:14:44] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:14:45] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2023-03-22 03:14:46] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-22 03:14:46] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-22 03:14:46] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2023-03-22 03:14:47] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 1 ms to minimize.
[2023-03-22 03:14:47] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-22 03:14:47] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4615 ms
[2023-03-22 03:14:47] [INFO ] After 20362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6183 ms.
[2023-03-22 03:14:53] [INFO ] After 26779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 03:14:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 22 ms.
[2023-03-22 03:14:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1283 places, 1083 transitions and 4975 arcs took 9 ms.
[2023-03-22 03:14:54] [INFO ] Flatten gal took : 184 ms
Total runtime 153951 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/1025/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13769556 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098004 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-PT-040B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717100494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;